{"id":"https://openalex.org/W1530227554","doi":"https://doi.org/10.1007/978-3-642-14052-5_16","title":"Formal Study of Plane Delaunay Triangulation","display_name":"Formal Study of Plane Delaunay Triangulation","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1530227554","doi":"https://doi.org/10.1007/978-3-642-14052-5_16","mag":"1530227554"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-14052-5_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14052-5_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5110245167","display_name":"Jean\u2010Fran\u00e7ois Dufourd","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Fran\u00e7ois Dufourd","raw_affiliation_strings":["Universit\u00e9 de Strasbourg, LSIIT, UMR CNRS-UdS 7005, P\u00f4le API, Boulevard S. Brant, BP 10413, 67412, Illkirch, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Strasbourg, LSIIT, UMR CNRS-UdS 7005, P\u00f4le API, Boulevard S. Brant, BP 10413, 67412, Illkirch, France","institution_ids":["https://openalex.org/I68947357","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013318461","display_name":"Yves Bertot","orcid":"https://orcid.org/0000-0001-5052-3019"},"institutions":[{"id":"https://openalex.org/I4210106545","display_name":"Research Centre Inria Sophia Antipolis - M\u00e9diterran\u00e9e","ror":"https://ror.org/01nzkaw91","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106545"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yves Bertot","raw_affiliation_strings":["INRIA-Centre de Sophia Antipolis M\u00e9diterran\u00e9e, 2004, Route des Lucioles, 06902, Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA-Centre de Sophia Antipolis M\u00e9diterran\u00e9e, 2004, Route des Lucioles, 06902, Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I4210106545","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110245167"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I68947357"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2619,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.74959872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"226"},"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.9997000098228455,"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.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9948999881744385,"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/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"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.9752094745635986},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.8809139728546143},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.8644427061080933},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8331437110900879},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.6590338349342346},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.5589860677719116},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5101850032806396},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5098713636398315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.482679158449173},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.44151827692985535},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.4267587661743164},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41461342573165894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35983020067214966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35523366928100586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3545319437980652},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1655484437942505},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13047334551811218},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11984986066818237}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9752094745635986},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.8809139728546143},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.8644427061080933},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8331437110900879},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.6590338349342346},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.5589860677719116},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5101850032806396},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5098713636398315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.482679158449173},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.44151827692985535},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.4267587661743164},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41461342573165894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35983020067214966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35523366928100586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3545319437980652},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1655484437942505},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13047334551811218},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11984986066818237}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-14052-5_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14052-5_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W198888619","https://openalex.org/W1508641834","https://openalex.org/W1541694476","https://openalex.org/W1553511155","https://openalex.org/W1555504576","https://openalex.org/W1560253649","https://openalex.org/W1571323540","https://openalex.org/W1578750710","https://openalex.org/W1579444899","https://openalex.org/W1717757824","https://openalex.org/W1753642991","https://openalex.org/W1821564862","https://openalex.org/W1964824815","https://openalex.org/W1969213662","https://openalex.org/W1971748934","https://openalex.org/W1987816136","https://openalex.org/W2012142654","https://openalex.org/W2038089707","https://openalex.org/W2046255686","https://openalex.org/W2052165970","https://openalex.org/W2066621462","https://openalex.org/W2082102386","https://openalex.org/W2093262333","https://openalex.org/W2105516957","https://openalex.org/W2117060314","https://openalex.org/W2148713284","https://openalex.org/W2149906774","https://openalex.org/W2155673213","https://openalex.org/W2166210250","https://openalex.org/W2573905970","https://openalex.org/W2799004609","https://openalex.org/W4235282062","https://openalex.org/W4251391716","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W149465645","https://openalex.org/W2016775690","https://openalex.org/W2001351033","https://openalex.org/W2026181493","https://openalex.org/W2094100801","https://openalex.org/W2611154072","https://openalex.org/W2509795980","https://openalex.org/W2350914983"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}