{"id":"https://openalex.org/W2014843742","doi":"https://doi.org/10.1007/bf01553881","title":"Constrained delaunay triangulations","display_name":"Constrained delaunay triangulations","publication_year":1989,"publication_date":"1989-06-01","ids":{"openalex":"https://openalex.org/W2014843742","doi":"https://doi.org/10.1007/bf01553881","mag":"2014843742"},"language":"en","primary_location":{"id":"doi:10.1007/bf01553881","doi":"https://doi.org/10.1007/bf01553881","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01553881","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5111811662","display_name":"L. Paul Chew","orcid":null,"observed_orcids":[]},"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":"L. Paul Chew","raw_affiliation_strings":["Department of Mathematics and Computer Science, Dartmouth College, 03755, Hanover, NH, USA","Department of Mathematics and Computer Science, Dartmouth College, Hanover, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Dartmouth College, 03755, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Dartmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111811662"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":9.2941,"has_fulltext":false,"cited_by_count":764,"citation_normalized_percentile":{"value":0.97702703,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"4","issue":"1-4","first_page":"97","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"constrained Delaunay triangulation","score":0.996999979019165},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.9120000004768372},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.8610000014305115},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.5149999856948853},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6480000019073486},{"id":"https://openalex.org/keywords/finite-element-analysis","display_name":"finite element analysis","score":0.7039999961853027},{"id":"https://openalex.org/keywords/motion-planning","display_name":"motion planning","score":0.9509999752044678},{"id":"https://openalex.org/keywords/polygonal-obstacles","display_name":"polygonal obstacles","score":0.9369999766349792},{"id":"https://openalex.org/keywords/triangulation-algorithms","display_name":"triangulation algorithms","score":0.4359999895095825}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9739366769790649},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.908927321434021},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.9029703140258789},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.8265585899353027},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.6417936086654663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.631441593170166},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6269127726554871},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.5956963300704956},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.5849238038063049},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5514666438102722},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.4153614938259125}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01553881","doi":"https://doi.org/10.1007/bf01553881","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01553881","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.8264","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.8264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.jhu.edu/~misha/Spring08b/Chew87.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1976125024","https://openalex.org/W2000744043","https://openalex.org/W2002827932","https://openalex.org/W2004988621","https://openalex.org/W2011124327","https://openalex.org/W2029986998","https://openalex.org/W2060513624","https://openalex.org/W2070164574","https://openalex.org/W2125865439","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W2383147437","https://openalex.org/W4233223451","https://openalex.org/W2098457762","https://openalex.org/W2044536971","https://openalex.org/W158679550","https://openalex.org/W2026181493","https://openalex.org/W2469185453","https://openalex.org/W7095562315","https://openalex.org/W2551930593","https://openalex.org/W7097079678"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":31},{"year":2022,"cited_by_count":30},{"year":2021,"cited_by_count":45},{"year":2020,"cited_by_count":40},{"year":2019,"cited_by_count":33},{"year":2018,"cited_by_count":27},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":29},{"year":2015,"cited_by_count":37},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":30},{"year":2012,"cited_by_count":26}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}