{"id":"https://openalex.org/W3085548081","doi":"https://doi.org/10.1007/s00454-020-00235-7","title":"Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets","display_name":"Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets","publication_year":2020,"publication_date":"2020-09-08","ids":{"openalex":"https://openalex.org/W3085548081","doi":"https://doi.org/10.1007/s00454-020-00235-7","mag":"3085548081","pmid":"https://pubmed.ncbi.nlm.nih.gov/34720304"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-020-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-020-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-020-00235-7.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-020-00235-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105370783","display_name":"Jean\u2010Daniel Boissonnat","orcid":null},"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"]},{"id":"https://openalex.org/I4210150884","display_name":"Fondation Sophia Antipolis","ror":"https://ror.org/05nkcfv27","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210150884"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Daniel Boissonnat","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d'Azur, INRIA Sophia-Antipolis, Sophia-Antipolis, France","DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d'Azur, INRIA Sophia-Antipolis, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I4210150884","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210126360"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043040182","display_name":"Olivier Devillers","orcid":"https://orcid.org/0000-0003-4275-5068"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Devillers","raw_affiliation_strings":["INRIA, CNRS, Loria, Universit\u00e9 de Lorraine, Nancy, France","Laboratoire Cogitamus = Cogitamus Laboratory (France)","GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm (615 rue du Jardin Botanique 54600 Villers-l\u00e8s-Nancy - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, CNRS, Loria, Universit\u00e9 de Lorraine, Nancy, France","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire Cogitamus = Cogitamus Laboratory (France)","institution_ids":[]},{"raw_affiliation_string":"GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm (615 rue du Jardin Botanique 54600 Villers-l\u00e8s-Nancy - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064136684","display_name":"Kunal Dutta","orcid":"https://orcid.org/0000-0003-3055-9326"},"institutions":[{"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"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["FR","PL"],"is_corresponding":false,"raw_author_name":"Kunal Dutta","raw_affiliation_strings":["Department of Informatics, University of Warsaw, Warsaw, Poland","DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)"],"raw_orcid":"https://orcid.org/0000-0003-3055-9326","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210126360"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083295077","display_name":"Marc Glisse","orcid":"https://orcid.org/0000-0001-6914-1651"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"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":"Marc Glisse","raw_affiliation_strings":["INRIA, Universit\u00e9 Paris-Saclay, \u00cele-de-France, France","DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Universit\u00e9 Paris-Saclay, \u00cele-de-France, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I277688954"]},{"raw_affiliation_string":"DATASHAPE - Understanding the Shape of Data (Inria Saclay\r\n1, rue Honor\u00e9 d\u2019Estienne d\u2019Orves\r\n91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210126360"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5105370783"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210126360","https://openalex.org/I4210150884"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.4452,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87097234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"1","first_page":"236","last_page":"268"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9973999857902527,"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.9952999949455261,"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.8675881028175354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6965305209159851},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5866104960441589},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5340816974639893},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.5222545266151428},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.5117604732513428},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5041228532791138},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47233524918556213},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.4704799950122833},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4557695984840393},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4302665591239929},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.4209884703159332},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.3835432231426239},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3698241412639618},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09509587287902832}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.8675881028175354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6965305209159851},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5866104960441589},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5340816974639893},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.5222545266151428},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5117604732513428},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5041228532791138},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47233524918556213},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.4704799950122833},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4557695984840393},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4302665591239929},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.4209884703159332},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.3835432231426239},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3698241412639618},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09509587287902832},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00454-020-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-020-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-020-00235-7.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},{"id":"pmid:34720304","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/34720304","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & computational geometry","raw_type":null},{"id":"pmh:oai:HAL:hal-02937624v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-02937624","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":"https://link.springer.com/article/10.1007%2Fs00454-020-00235-7","raw_type":"Journal articles"},{"id":"pmh:oai:europepmc.org:7442358","is_oa":true,"landing_page_url":"http://europepmc.org/pmc/articles/PMC8549993","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":"","raw_type":"Text"},{"id":"pmh:oai:pubmedcentral.nih.gov:8549993","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/8549993","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Comput Geom","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s00454-020-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-020-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-020-00235-7.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G2113015678","display_name":null,"funder_award_id":"ANR-19-P3IA-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8202435710","display_name":null,"funder_award_id":"19-P3IA-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8318455765","display_name":null,"funder_award_id":"ANR-19","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3085548081.pdf","grobid_xml":"https://content.openalex.org/works/W3085548081.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W178783221","https://openalex.org/W622633677","https://openalex.org/W1494599013","https://openalex.org/W1593563200","https://openalex.org/W1614254900","https://openalex.org/W1969191546","https://openalex.org/W1976436266","https://openalex.org/W1997596515","https://openalex.org/W2000332739","https://openalex.org/W2005066177","https://openalex.org/W2014754855","https://openalex.org/W2029041800","https://openalex.org/W2048516789","https://openalex.org/W2051200663","https://openalex.org/W2056963858","https://openalex.org/W2058432138","https://openalex.org/W2062766966","https://openalex.org/W2063055940","https://openalex.org/W2071569218","https://openalex.org/W2073751737","https://openalex.org/W2081034786","https://openalex.org/W2097944783","https://openalex.org/W2125414988","https://openalex.org/W2126960445","https://openalex.org/W2127209311","https://openalex.org/W2131376597","https://openalex.org/W2140638704","https://openalex.org/W2162050448","https://openalex.org/W2207289595","https://openalex.org/W2295428206","https://openalex.org/W2318980250","https://openalex.org/W3138782396","https://openalex.org/W4231916799","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W2356383134","https://openalex.org/W1979251698","https://openalex.org/W149465645","https://openalex.org/W2016775690","https://openalex.org/W2094100801","https://openalex.org/W2001351033","https://openalex.org/W2611154072","https://openalex.org/W2026181493"],"abstract_inverted_index":{"Abstract":[0],"Randomized":[1,40],"incremental":[2,41],"construction":[3,56],"(RIC)":[4],"is":[5,87,96,107,231,247,270],"one":[6],"of":[7,57,64,113,154,197,223,227,261,267,276,280,283,306],"the":[8,49,55,68,85,90,93,101,110,178,184,195,217,225,228,265,274,277,292],"most":[9],"important":[10],"paradigms":[11],"for":[12,299],"building":[13],"geometric":[14],"data":[15],"structures.":[16],"Clarkson":[17],"and":[18,33,37,46,62,75,181,200,221],"Shor":[19],"developed":[20],"a":[21,151,271,296],"general":[22],"theory":[23,36],"that":[24,92,109],"led":[25],"to":[26,79,150,258],"numerous":[27],"algorithms":[28],"which":[29,246,303],"are":[30,43],"both":[31],"simple":[32],"efficient":[34],"in":[35,38,48,73,89,100,117,133,177,183,207,216],"practice.":[39],"constructions":[42],"usually":[44],"space-optimal":[45],"time-optimal":[47],"worst":[50,102],"case,":[51],"as":[52,148],"exemplified":[53],"by":[54],"convex":[58],"hulls,":[59],"Delaunay":[60,111,278],"triangulations,":[61],"arrangements":[63],"line":[65],"segments.":[66],"However,":[67],"worst-case":[69,152],"scenario":[70],"occurs":[71],"rarely":[72],"practice":[74],"we":[76,201,212,294],"would":[77],"like":[78],"understand":[80],"how":[81],"RIC":[82,230,255],"behaves":[83],"when":[84],"input":[86],"nice":[88],"sense":[91],"associated":[94],"output":[95],"significantly":[97],"smaller":[98],"than":[99],"case.":[103],"For":[104],"example,":[105],"it":[106],"known":[108],"triangulation":[112,279],"nicely":[114,256],"distributed":[115],"points":[116],"$${\\mathbb":[118,134],"{E}}^d$$":[119],"<mml:math":[120,136,159,234,286],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[121,137,160,235,287],"<mml:msup>":[122,138,164],"<mml:mrow>":[123,139,161,166,236],"<mml:mi>E</mml:mi>":[124,140],"</mml:mrow>":[125,141,172,175,243],"<mml:mi>d</mml:mi>":[126,168],"</mml:msup>":[127,143,173],"</mml:math>":[128,144,176,244,289],"or":[129],"on":[130,194,273],"polyhedral":[131],"surfaces":[132],"{E}}^3$$":[135],"<mml:mn>3</mml:mn>":[142],"has":[145],"linear":[146],"complexity,":[147],"opposed":[149],"complexity":[153,196,226,275],"$$\\Theta":[155],"(n^{\\lfloor":[156],"d/2\\rfloor":[157],"})$$":[158],"<mml:mi>\u0398</mml:mi>":[162],"<mml:mo>(</mml:mo>":[163,238],"<mml:mi>n</mml:mi>":[165,239,241],"<mml:mo>\u230a</mml:mo>":[167],"<mml:mo>/</mml:mo>":[169],"<mml:mn>2</mml:mn>":[170],"<mml:mo>\u230b</mml:mo>":[171],"<mml:mo>)</mml:mo>":[174,242],"first":[179],"case":[180],"quadratic":[182],"second.":[185],"The":[186],"standard":[187],"analysis":[188],"does":[189],"not":[190],"provide":[191],"accurate":[192],"bounds":[193,206],"such":[198,205],"cases":[199,219,260],"aim":[202],"at":[203],"establishing":[204],"this":[208],"paper.":[209],"More":[210],"precisely,":[211],"will":[213],"show":[214],"that,":[215],"two":[218],"above":[220],"variants":[222],"them,":[224],"usual":[229],"$$O(n\\log":[232],"n)$$":[233],"<mml:mi>O</mml:mi>":[237],"<mml:mo>log</mml:mo>":[240],",":[245],"optimal.":[248],"In":[249],"other":[250],"words,":[251],"without":[252,301],"any":[253],"modification,":[254],"adapts":[257],"good":[259],"practical":[262],"value.":[263],"At":[264],"heart":[266],"our":[268],"proof":[269],"bound":[272],"random":[281],"subsets":[282],"$${\\varepsilon":[284],"}$$":[285],"<mml:mi>\u03b5</mml:mi>":[288],"-nets.":[290],"Along":[291],"way,":[293],"prove":[295],"probabilistic":[297],"lemma":[298],"sampling":[300],"replacement,":[302],"may":[304],"be":[305],"independent":[307],"interest.":[308]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-16T08:24:45.110214","created_date":"2025-10-10T00:00:00"}