{"id":"https://openalex.org/W2154441579","doi":"https://doi.org/10.1145/2462356.2462389","title":"Fast segment insertion and incremental construction of constrained delaunay triangulations","display_name":"Fast segment insertion and incremental construction of constrained delaunay triangulations","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2154441579","doi":"https://doi.org/10.1145/2462356.2462389","mag":"2154441579"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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/A5064244744","display_name":"Jonathan Richard Shewchuk","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Richard Shewchuk","raw_affiliation_strings":["University of California at Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012312357","display_name":"Brielin C. Brown","orcid":"https://orcid.org/0000-0001-5569-5223"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brielin C. Brown","raw_affiliation_strings":["University of California at Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.25548589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"308"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9857000112533569,"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"}},{"id":"https://openalex.org/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9851999878883362,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.931698739528656},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.6595607995986938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6463311910629272},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5094299912452698},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5053480267524719},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5038973689079285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4543730914592743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45309191942214966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44004225730895996},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4121042490005493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3528698682785034},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10124275088310242}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.931698739528656},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.6595607995986938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6463311910629272},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5094299912452698},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5053480267524719},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5038973689079285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4543730914592743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45309191942214966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44004225730895996},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4121042490005493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3528698682785034},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10124275088310242},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2462356.2462389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.381.3003","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.3003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~jrs/papers/inccdt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.640.326","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.640.326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~jrs/papers/inccdtj.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W16335429","https://openalex.org/W102262102","https://openalex.org/W1500264731","https://openalex.org/W1595208863","https://openalex.org/W1826955156","https://openalex.org/W1900417662","https://openalex.org/W1970758273","https://openalex.org/W1976392173","https://openalex.org/W1984406695","https://openalex.org/W1995132018","https://openalex.org/W2002827932","https://openalex.org/W2004988621","https://openalex.org/W2007610503","https://openalex.org/W2014843742","https://openalex.org/W2035774625","https://openalex.org/W2036773635","https://openalex.org/W2040474790","https://openalex.org/W2046053182","https://openalex.org/W2050417465","https://openalex.org/W2052165970","https://openalex.org/W2054459484","https://openalex.org/W2056411324","https://openalex.org/W2067631433","https://openalex.org/W2070164574","https://openalex.org/W2106413026","https://openalex.org/W2109067871","https://openalex.org/W2116179136","https://openalex.org/W2119352997","https://openalex.org/W2128672663","https://openalex.org/W2130466095","https://openalex.org/W2131376597","https://openalex.org/W2141516920","https://openalex.org/W2170083611","https://openalex.org/W2282797220","https://openalex.org/W2497502585","https://openalex.org/W2911778173","https://openalex.org/W2964725934","https://openalex.org/W4250379648","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1883162576","https://openalex.org/W2385297469","https://openalex.org/W2374047534","https://openalex.org/W2001351033","https://openalex.org/W2347819474","https://openalex.org/W2381889232","https://openalex.org/W2359979928","https://openalex.org/W2026181493","https://openalex.org/W2509795980","https://openalex.org/W2385619438"],"abstract_inverted_index":{"The":[0],"most":[1],"commonly":[2],"implemented":[3],"method":[4,38],"of":[5,34,50,58,80,105,115],"constructing":[6],"a":[7,19,40,63,68,71,88,141,176,180],"constrained":[8],"Delaunay":[9,20],"triangulation":[10],"(CDT)":[11],"in":[12,73,77,154,168,184],"the":[13,25,48,56,78,82,171],"plane":[14],"is":[15,47,55,93,137,162,182],"to":[16,152,164,173],"first":[17],"construct":[18],"triangulation,":[21],"then":[22],"incrementally":[23,174],"insert":[24],"input":[26,51,59],"segments":[27,98],"one":[28],"by":[29,117,139,178],"one.":[30],"For":[31],"typical":[32],"implementations":[33],"segment":[35,69,83,119,181],"insertion,":[36],"this":[37,135],"has":[39],"\u0398(kn2)":[41],"worst-case":[42],"running":[43],"time,":[44,158],"where":[45],"n":[46,126,128],"number":[49,57,79],"vertices":[52],"and":[53,85,108,166],"k":[54],"segments.":[60],"We":[61,132],"give":[62],"randomized":[64,112],"algorithm":[65,121],"for":[66,97],"inserting":[67,179],"into":[70],"CDT":[72,148,160,177],"expected":[74,123],"time":[75],"linear":[76],"edges":[81],"crosses,":[84],"demonstrate":[86],"with":[87],"performance":[89],"comparison":[90],"that":[91,99,111,134],"it":[92],"faster":[94],"than":[95],"gift-wrapping":[96],"cross":[100],"many":[101],"edges.":[102],"A":[103],"result":[104],"Agarwal,":[106],"Arge,":[107],"Yi":[109],"implies":[110],"incremental":[113,159],"construction":[114,149,161],"CDTs":[116],"our":[118],"insertion":[120],"takes":[122],"O(n":[124,155],"log":[125,156],"+":[127],"log2":[129],"k)":[130],"time.":[131],"show":[133],"bound":[136],"tight":[138],"deriving":[140],"matching":[142],"lower":[143],"bound.":[144],"Although":[145],"there":[146],"are":[147],"algorithms":[150],"guaranteed":[151],"run":[153],"n)":[157],"easier":[163],"program":[165],"competitive":[167],"practice.":[169],"Moreover,":[170],"ability":[172],"update":[175],"useful":[183],"itself.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}