{"id":"https://openalex.org/W2121666768","doi":"https://doi.org/10.1002/net.3230170306","title":"A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph","display_name":"A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2121666768","doi":"https://doi.org/10.1002/net.3230170306","mag":"2121666768"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104018898","display_name":"Jayaram Bhasker","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jayaram Bhasker","raw_affiliation_strings":["Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455","Computer Science Department, University of Minnesota, Minneapolis, Minnesota, 55455"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Minneapolis, Minnesota, 55455","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj Sahni","raw_affiliation_strings":["Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455","Computer Science Department, University of Minnesota, Minneapolis, Minnesota, 55455"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Minneapolis, Minnesota 55455","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Computer Science Department, University of Minnesota, Minneapolis, Minnesota, 55455","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104018898"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.927,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.77423168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"17","issue":"3","first_page":"307","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9753000140190125,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6773779392242432},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.593334972858429},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5794615149497986},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5613512396812439},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5562748312950134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.533798098564148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5200226306915283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4433111548423767},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.4406622350215912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4396286904811859},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3515075743198395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.326116144657135},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14122948050498962},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1262744963169098},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.0977109968662262},{"id":"https://openalex.org/keywords/art","display_name":"Art","score":0.06604713201522827}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6773779392242432},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.593334972858429},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5794615149497986},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5613512396812439},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5562748312950134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.533798098564148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5200226306915283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4433111548423767},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.4406622350215912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4396286904811859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3515075743198395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.326116144657135},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14122948050498962},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1262744963169098},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0977109968662262},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.06604713201522827},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170306","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1545078296","https://openalex.org/W1554451661","https://openalex.org/W1655990431","https://openalex.org/W1986679986","https://openalex.org/W2023112489","https://openalex.org/W2092020648","https://openalex.org/W4239825409","https://openalex.org/W4245996889","https://openalex.org/W4246290318","https://openalex.org/W4253828016"],"related_works":["https://openalex.org/W2081273953","https://openalex.org/W2246199414","https://openalex.org/W4300508906","https://openalex.org/W2003472496","https://openalex.org/W2990956612","https://openalex.org/W3216105633","https://openalex.org/W2006448585","https://openalex.org/W1603990805","https://openalex.org/W1501166601","https://openalex.org/W2768011086"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"develop":[2],"a":[3,10,16],"linear":[4],"time":[5],"algorithm":[6],"to":[7],"determine":[8],"if":[9],"given":[11],"planar":[12],"triangulated":[13],"graph":[14],"has":[15],"rectangular":[17],"dual.":[18]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}