{"id":"https://openalex.org/W2140638704","doi":"https://doi.org/10.1145/2462356.2462404","title":"A fast algorithm for well-spaced points and approximate delaunay graphs","display_name":"A fast algorithm for well-spaced points and approximate delaunay graphs","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2140638704","doi":"https://doi.org/10.1145/2462356.2462404","mag":"2140638704"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462404","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462404","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00924494","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010457003","display_name":"Gary L. Miller","orcid":"https://orcid.org/0000-0001-5456-8097"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary L. Miller","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083016446","display_name":"Donald R. Sheehy","orcid":"https://orcid.org/0000-0002-9177-2713"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Donald R. Sheehy","raw_affiliation_strings":["Inria Saclay Ile-de-France, Palaiseau, France","[Inria Saclay-Ile-de-France, Palaiseau, France]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria Saclay Ile-de-France, Palaiseau, France","institution_ids":["https://openalex.org/I4210126360"]},{"raw_affiliation_string":"[Inria Saclay-Ile-de-France, Palaiseau, France]","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082285837","display_name":"Ameya Velingker","orcid":"https://orcid.org/0000-0001-9641-1020"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ameya Velingker","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.044,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.94827586,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"298"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9936000108718872,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.7233821749687195},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6936348676681519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5580543875694275},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.523428201675415},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5078571438789368},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5057501792907715},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49248942732810974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4599555730819702},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43910133838653564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37437134981155396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3422187566757202},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09233331680297852}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.7233821749687195},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6936348676681519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5580543875694275},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.523428201675415},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5078571438789368},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5057501792907715},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49248942732810974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4599555730819702},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43910133838653564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37437134981155396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3422187566757202},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09233331680297852},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2462356.2462404","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462404","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:repository.cmu.edu:compsci-3689","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=3689&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6587378","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Journal contribution"},{"id":"pmh:oai:HAL:hal-00924494v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00924494","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Symposium on Computational Geometry, 2013, Rio de Janeiro, Brazil. pp.289--298","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00924494v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00924494","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Symposium on Computational Geometry, 2013, Rio de Janeiro, Brazil. pp.289--298","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W162712129","https://openalex.org/W1487551524","https://openalex.org/W1826955156","https://openalex.org/W1909076809","https://openalex.org/W1967337063","https://openalex.org/W1982483258","https://openalex.org/W1989566182","https://openalex.org/W2029013805","https://openalex.org/W2045134120","https://openalex.org/W2052967435","https://openalex.org/W2055558637","https://openalex.org/W2056700535","https://openalex.org/W2063135141","https://openalex.org/W2071569218","https://openalex.org/W2100440346","https://openalex.org/W2129412583","https://openalex.org/W2140638704","https://openalex.org/W2167816765","https://openalex.org/W2283440349","https://openalex.org/W2615226098","https://openalex.org/W4238439059","https://openalex.org/W4293860921","https://openalex.org/W6638500188"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2368353614","https://openalex.org/W2390369954","https://openalex.org/W1529719486","https://openalex.org/W4232052003","https://openalex.org/W2373917503","https://openalex.org/W2906423005","https://openalex.org/W2385297469","https://openalex.org/W2001914902","https://openalex.org/W2353399380"],"abstract_inverted_index":{"We":[0,26],"present":[1],"a":[2,7,14],"new":[3],"algorithm":[4,38],"that":[5],"produces":[6],"well-spaced":[8],"superset":[9],"of":[10],"points":[11],"conforming":[12],"to":[13],"given":[15],"input":[16,52],"set":[17,59],"in":[18,40],"any":[19],"dimension":[20],"with":[21],"guaranteed":[22],"optimal":[23],"output":[24,35,57],"size.":[25],"also":[27],"provide":[28],"an":[29],"approximate":[30],"Delaunay":[31],"graph":[32],"on":[33,71],"the":[34,51,56,64,72],"points.":[36],"Our":[37],"runs":[39],"expected":[41],"time":[42],"O(2O(d)(n":[43],"log":[44],"n":[45,49],"+":[46],"m)),":[47],"where":[48],"is":[50,55,63],"size,":[53,60],"m":[54],"point":[58],"and":[61],"d":[62],"ambient":[65],"dimension.":[66],"The":[67],"constants":[68],"only":[69],"depend":[70],"desired":[73],"element":[74],"quality":[75],"bounds.":[76]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}