{"id":"https://openalex.org/W2901754088","doi":"https://doi.org/10.1142/s021819591850005x","title":"A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs","display_name":"A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2901754088","doi":"https://doi.org/10.1142/s021819591850005x","mag":"2901754088"},"language":"en","primary_location":{"id":"doi:10.1142/s021819591850005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819591850005x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","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/A5014017086","display_name":"Fabrizio d\u2019Amore","orcid":"https://orcid.org/0000-0002-6518-2445"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio d\u2019Amore","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Automatica e Gestionale Antonio Ruberti, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Via Ariosto 25, I-00185 Roma, Italy"],"raw_orcid":"https://orcid.org/0000-0002-6518-2445","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale Antonio Ruberti, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Via Ariosto 25, I-00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045218419","display_name":"Paolo Giulio Franciosa","orcid":"https://orcid.org/0000-0002-5464-4069"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo G. Franciosa","raw_affiliation_strings":["Dipartimento di Scienze Statistiche, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Piazzale Aldo Moro 5, I-00185 Roma, Italy"],"raw_orcid":"https://orcid.org/0000-0002-5464-4069","affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze Statistiche, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Piazzale Aldo Moro 5, I-00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19918473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"03","first_page":"227","last_page":"253"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"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/mathematics","display_name":"Mathematics","score":0.7031526565551758},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5538952946662903},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46376869082450867},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.44646549224853516},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.43544453382492065},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4342797100543976},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4258831739425659},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3907180726528168},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36608633399009705}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7031526565551758},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5538952946662903},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46376869082450867},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.44646549224853516},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.43544453382492065},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4342797100543976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4258831739425659},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3907180726528168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36608633399009705},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s021819591850005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819591850005x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1197997","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/1197997","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1614327447","display_name":null,"funder_award_id":"2012C4E3KT","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"}],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1501243125","https://openalex.org/W1964080182","https://openalex.org/W1968721698","https://openalex.org/W1975549052","https://openalex.org/W1992843866","https://openalex.org/W1993216012","https://openalex.org/W2013279615","https://openalex.org/W2023618719","https://openalex.org/W2024905920","https://openalex.org/W2029673229","https://openalex.org/W2031671531","https://openalex.org/W2043552663","https://openalex.org/W2049799129","https://openalex.org/W2052262841","https://openalex.org/W2062482828","https://openalex.org/W2067049088","https://openalex.org/W2085363460","https://openalex.org/W2093241092","https://openalex.org/W2104923354","https://openalex.org/W2125512233","https://openalex.org/W2128865241","https://openalex.org/W2132105558","https://openalex.org/W2148934646","https://openalex.org/W2161558549","https://openalex.org/W2163227453","https://openalex.org/W2169004268","https://openalex.org/W2171694703","https://openalex.org/W2911302472","https://openalex.org/W3020889619","https://openalex.org/W4230228880","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1585318792","https://openalex.org/W28092394","https://openalex.org/W1987064509"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,270],"study":[4],"the":[5,13,17,22,32,35,40,54,69,91,96,115,119,128,133,204,210,290,300,308,313,326,329],"problem":[6],"of":[7,26,29,53,71,90,118,127,135,175,203,212,231,267,302,317,320],"designing":[8],"robust":[9,116],"algorithms":[10,80],"for":[11,95,132,254,284],"computing":[12,285],"minimum":[14,152],"spanning":[15,153],"tree,":[16],"nearest":[18],"neighbor":[19],"graph,":[20],"and":[21,59,61,160,186,188,223,241,247],"relative":[23,286,314],"neighborhood":[24,287,315],"graph":[25,316],"a":[27,111,125,172,264,272,303,318],"set":[28,319],"points":[30,321],"in":[31,68,88,144,155,182,215,289,325],"plane,":[33],"under":[34,328],"Euclidean":[36],"metric.":[37,333],"We":[38,109,169],"use":[39],"term":[41],"\u201crobust\u201d":[42],"to":[43,74,114,197],"denote":[44],"an":[45],"algorithm":[46,233],"that":[47,62,81,171,311],"can":[48,179],"properly":[49],"handle":[50,100],"degenerate":[51],"configurations":[52],"input":[55],"(such":[56],"as":[57],"co-circularities":[58],"collinearities)":[60],"is":[63,124,195,206],"not":[64],"affected":[65],"by":[66,208,276],"errors":[67],"flow":[70],"control":[72],"due":[73],"round-off":[75],"approximations.":[76],"Existing":[77],"asymptotically":[78,183],"optimal":[79,184],"compute":[82],"such":[83],"graphs":[84,137,178,288],"are":[85,103],"either":[86],"suboptimal":[87],"terms":[89],"arithmetic":[92,201],"precision":[93,192],"required":[94],"implementation,":[97],"or":[98,102],"cannot":[99],"degeneracies,":[101],"based":[104,138,306],"on":[105,139,307],"complex":[106],"data":[107],"structures.":[108],"present":[110],"unified":[112],"approach":[113,123,131,205,283],"computation":[117,134],"above":[120],"graphs.":[121],"The":[122,200,281],"variant":[126],"general":[129],"region":[130,282,309],"proximity":[136,227],"Yao":[140],"graphs,":[141],"first":[142],"introduced":[143,214],"Ref.":[145,216,242],"43":[146],"(A.":[147],"C.-C.":[148],"Yao,":[149],"On":[150],"constructing":[151],"trees":[154],"[Formula:":[156,291,322,330],"see":[157,292,323,331],"text]-dimensional":[158],"spaces":[159],"related":[161],"problems,":[162],"SIAM":[163,235,257],"J.":[164,236,258],"Comput.":[165,237,259],"11(4)":[166],"(1982)":[167],"721\u2013736).":[168],"show":[170],"sparse":[173],"supergraph":[174],"these":[176],"geometric":[177],"be":[180,198],"computed":[181],"time":[185],"space,":[187],"requiring":[189],"only":[190],"double":[191],"arithmetic,":[193],"which":[194],"proved":[196],"optimal.":[199],"complexity":[202],"measured":[207],"using":[209],"notion":[211],"degree,":[213],"31":[217],"(G.":[218],"Liotta,":[219],"F.":[220,248],"P.":[221,249],"Preparata":[222],"R.":[224],"Tamassia,":[225],"Robust":[226,251],"queries:":[228],"An":[229],"illustration":[230],"degree-driven":[232],"design,":[234],"28(3)":[238],"(1998)":[239],"864\u2013889)":[240],"3":[243],"(J.":[244,279],"D.":[245],"Boissonnat":[246],"Preparata,":[250],"plane":[252,327],"sweep":[253],"intersecting":[255],"segments,":[256],"29(5)":[260],"(2000)":[261],"1401\u20131421).":[262],"As":[263],"side":[265],"effect":[266],"our":[268],"results,":[269],"solve":[271],"question":[273],"left":[274],"open":[275],"Katajainen":[277],"27":[278],"Katajainen,":[280],"text]":[293,324,332],"metric,":[294],"Computing":[295],"40":[296],"(1987)":[297],"147\u2013161)":[298],"about":[299],"existence":[301],"subquadratic":[304],"algorithm,":[305],"approach,":[310],"computes":[312]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-11-29T00:00:00"}