{"id":"https://openalex.org/W2762718201","doi":"https://doi.org/10.1137/110825698","title":"Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent","display_name":"Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2762718201","doi":"https://doi.org/10.1137/110825698","mag":"2762718201"},"language":"en","primary_location":{"id":"doi:10.1137/110825698","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110825698","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1205.4738","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Maarten L\u00f6ffler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Maarten L\u00f6ffler","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Wolfgang Mulzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wolfgang Mulzer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7254,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82272876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"41","issue":"4","first_page":"941","last_page":"974"},"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.9835000038146973,"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.9835000038146973,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.00570000009611249,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.001500000013038516,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.9623000025749207},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.8788999915122986},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.8145999908447266},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.8050000071525574},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.7955999970436096},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.667900025844574},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.623199999332428},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5891000032424927}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9623000025749207},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.8788999915122986},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.8145999908447266},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.8050000071525574},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.7955999970436096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6714000105857849},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.667900025844574},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.623199999332428},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5891000032424927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.482699990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41749998927116394},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2849000096321106},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110825698","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110825698","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1205.4738","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4738","pdf_url":"https://arxiv.org/pdf/1205.4738","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1205.4738","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4738","pdf_url":"https://arxiv.org/pdf/1205.4738","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1972369894","https://openalex.org/W1983487792","https://openalex.org/W1992843866","https://openalex.org/W2008196645","https://openalex.org/W2011999472","https://openalex.org/W2014665344","https://openalex.org/W2031671531","https://openalex.org/W2032841680","https://openalex.org/W2041094480","https://openalex.org/W2049774319","https://openalex.org/W2050417465","https://openalex.org/W2054011861","https://openalex.org/W2060270693","https://openalex.org/W2093241092","https://openalex.org/W2094974501","https://openalex.org/W2105246008","https://openalex.org/W2106413026","https://openalex.org/W2113604744","https://openalex.org/W2120018535","https://openalex.org/W2121431945","https://openalex.org/W2147026670","https://openalex.org/W2161679356","https://openalex.org/W2164485560","https://openalex.org/W2168320878","https://openalex.org/W2762452592","https://openalex.org/W4238924095"],"related_works":[],"abstract_inverted_index":{"We":[0,98],"show":[1,99],"that":[2,84,100],"Delaunay":[3,30,36,129,147,153,160,164],"triangulations":[4],"and":[5,57,63,65,67,162],"compressed":[6,21,40],"quadtrees":[7],"are":[8],"equivalent":[9],"structures.":[10],"More":[11],"precisely,":[12],"we":[13,125,137],"give":[14],"two":[15],"algorithms:":[16],"the":[17,29,32,35,73,77,102,121,128],"first":[18],"computes":[19],"a":[20,24,39,50,82,105,110,135],"quadtree":[22],"for":[23,72,158],"planar":[25,111,152],"point":[26],"set,":[27],"given":[28,38],"triangulation;":[31],"second":[33,74],"finds":[34],"triangulation,":[37],"quadtree.":[41],"Both":[42],"algorithms":[43,144],"run":[44],"in":[45,95,117,131],"deterministic":[46,139],"linear":[47,118,132],"time":[48],"on":[49,56],"pointer":[51],"machine.":[52],"Our":[53,69],"work":[54],"builds":[55],"extends":[58],"previous":[59,143],"results":[60],"by":[61],"Krznaric":[62],"Levcopolous":[64],"Buchin":[66],"Mulzer.":[68],"main":[70],"tool":[71],"algorithm":[75],"is":[76],"well-separated":[78],"pair":[79],"decomposition":[80],"(WSPD),":[81],"structure":[83],"has":[85],"been":[86],"used":[87],"previously":[88],"to":[89,108,146],"find":[90,127],"Euclidean":[91,112],"minimum":[92,113],"spanning":[93,114],"trees":[94],"higher":[96],"dimensions.":[97],"knowing":[101],"WSPD":[103],"(and":[104],"quadtree)":[106],"suffices":[107],"compute":[109],"tree":[115],"(EMST)":[116],"time.":[119,133],"With":[120],"EMST":[122],"at":[123],"hand,":[124],"can":[126],"triangulation":[130],"As":[134],"corollary,":[136],"obtain":[138],"versions":[140],"of":[141],"many":[142],"related":[145],"triangulations,":[148,154],"such":[149],"as":[150],"splitting":[151],"preprocessing":[155],"imprecise":[156],"points":[157],"faster":[159],"computation,":[161],"transdichotomous":[163],"triangulations.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-10-20T00:00:00"}