{"id":"https://openalex.org/W2208229792","doi":"https://doi.org/10.1016/s0925-7721(96)00025-9","title":"A comparison of sequential Delaunay triangulation algorithms","display_name":"A comparison of sequential Delaunay triangulation algorithms","publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W2208229792","doi":"https://doi.org/10.1016/s0925-7721(96)00025-9","mag":"2208229792"},"language":"en","primary_location":{"id":"doi:10.1016/s0925-7721(96)00025-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0925-7721(96)00025-9","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/s0925-7721(96)00025-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056885138","display_name":"Peter Su","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Su","raw_affiliation_strings":["Justsystem Pittsburgh Research Center, 4616 Henry Street, Pittsburgh, PA 15213, USA"],"affiliations":[{"raw_affiliation_string":"Justsystem Pittsburgh Research Center, 4616 Henry Street, Pittsburgh, PA 15213, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103488244","display_name":"Robert L. Scot Drysdale","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert L. Scot Drysdale","raw_affiliation_strings":["Department of Computer Science, 6211 Sudikoff Laboratory, Dartmouth College, Hanover, NH 03755-3510, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, 6211 Sudikoff Laboratory, Dartmouth College, Hanover, NH 03755-3510, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103488244"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":{"value":2180,"currency":"USD","value_usd":2180},"apc_paid":{"value":2180,"currency":"USD","value_usd":2180},"fwci":2.2755,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.88541667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"7","issue":"5-6","first_page":"361","last_page":"385"},"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.9998999834060669,"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.9998999834060669,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9177902936935425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7961089611053467},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.700019359588623},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.6850929260253906},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.6542361974716187},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.5616548657417297},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5576884150505066},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.5335545539855957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5270947217941284},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.5064014196395874},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.48743727803230286},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.4681893587112427},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42308974266052246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4072328209877014},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.26597410440444946},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.12090897560119629}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9177902936935425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7961089611053467},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.700019359588623},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.6850929260253906},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.6542361974716187},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5616548657417297},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5576884150505066},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.5335545539855957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5270947217941284},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.5064014196395874},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.48743727803230286},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.4681893587112427},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42308974266052246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4072328209877014},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.26597410440444946},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.12090897560119629},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0925-7721(96)00025-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0925-7721(96)00025-9","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0925-7721(96)00025-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0925-7721(96)00025-9","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W71000211","https://openalex.org/W1536890784","https://openalex.org/W1982483258","https://openalex.org/W1984406695","https://openalex.org/W1989373517","https://openalex.org/W1991064236","https://openalex.org/W1996931690","https://openalex.org/W2004138302","https://openalex.org/W2015326607","https://openalex.org/W2024766881","https://openalex.org/W2035774625","https://openalex.org/W2041775009","https://openalex.org/W2052165970","https://openalex.org/W2057512681","https://openalex.org/W2058432138","https://openalex.org/W2062766966","https://openalex.org/W2070164574","https://openalex.org/W2097944783","https://openalex.org/W2100059510","https://openalex.org/W2122026921","https://openalex.org/W2125269219","https://openalex.org/W2143022779","https://openalex.org/W2161449253","https://openalex.org/W2733827376","https://openalex.org/W3161121673","https://openalex.org/W4254977685","https://openalex.org/W6602817872","https://openalex.org/W6631856526","https://openalex.org/W6646457823","https://openalex.org/W6675349770","https://openalex.org/W6678322375","https://openalex.org/W6678622568","https://openalex.org/W6681264222","https://openalex.org/W6740581430"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W2094100801","https://openalex.org/W2354492393","https://openalex.org/W2168284009","https://openalex.org/W2149044706","https://openalex.org/W2394349965","https://openalex.org/W2366852508","https://openalex.org/W2279660530","https://openalex.org/W4294492445"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,62,146],"experimental":[4,147],"comparison":[5],"of":[6,9,31,53,94,112,118,149,153],"a":[7,42,54,67,73,77,116],"number":[8,117],"different":[10],"algorithms":[11,18,83,96,114,142,155],"for":[12,84,100],"computing":[13],"the":[14,32,95,137],"Delaunay":[15,69],"triangulation.":[16],"The":[17,121],"examined":[19,97],"are:":[20],"Dwyer's":[21],"divide":[22],"and":[23,40,50,87,144],"conquer":[24],"algorithm,":[25,28],"Fortune's":[26],"sweepline":[27],"several":[29],"versions":[30],"incremental":[33],"algorithm":[34,45,57,63],"(including":[35],"one":[36],"by":[37],"Ohya,":[38],"Iri":[39],"Murota,":[41],"new":[43],"bucketing-based":[44],"described":[46],"in":[47,60,76],"this":[48],"paper,":[49],"Devillers's":[51],"version":[52],"Delaunay-tree":[55],"based":[56,91],"that":[58,64,141],"appears":[59],"LEDA),":[61],"incrementally":[65],"adds":[66],"correct":[68],"triangle":[70,75],"adjacent":[71],"to":[72,80,131],"current":[74],"manner":[78],"similar":[79],"gift":[81],"wrapping":[82],"convex":[85,89],"hulls,":[86],"Barber's":[88],"hull":[90],"algorithm.":[92],"Most":[93],"are":[98],"designed":[99],"good":[101],"performance":[102],"on":[103,115],"uniformly":[104],"distributed":[105],"sites.":[106],"However,":[107],"we":[108],"also":[109,135],"test":[110],"implementations":[111,152],"these":[113,154],"non-uniform":[119],"distributions.":[120],"experiments":[122],"go":[123],"beyond":[124],"measuring":[125],"total":[126],"running":[127],"time,":[128],"which":[129],"tends":[130],"be":[132],"machine-dependent.":[133],"We":[134],"analyze":[136],"major":[138],"high-level":[139],"primitives":[140],"use":[143],"do":[145],"analysis":[148],"how":[150],"often":[151],"perform":[156],"each":[157],"operation.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}