{"id":"https://openalex.org/W2174417008","doi":"https://doi.org/10.1137/140959067","title":"Approximating Minimization Diagrams and Generalized Proximity Search","display_name":"Approximating Minimization Diagrams and Generalized Proximity Search","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2174417008","doi":"https://doi.org/10.1137/140959067","mag":"2174417008"},"language":"en","primary_location":{"id":"doi:10.1137/140959067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140959067","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074936673","display_name":"Nirman Kumar","orcid":"https://orcid.org/0000-0001-6601-2790"},"institutions":[{"id":"https://openalex.org/I71561298","display_name":"Goodwin College","ror":"https://ror.org/009bjed14","country_code":"US","type":"education","lineage":["https://openalex.org/I71561298"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nirman Kumar","raw_affiliation_strings":["Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL, 61801, USA;","institution_ids":["https://openalex.org/I71561298","https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040577923"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I71561298"],"apc_list":null,"apc_paid":null,"fwci":3.5486,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92364081,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"44","issue":"4","first_page":"944","last_page":"974"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.8479440212249756},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.7062525749206543},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6886921525001526},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6224424839019775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6059973835945129},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.476071298122406},{"id":"https://openalex.org/keywords/weighted-voronoi-diagram","display_name":"Weighted Voronoi diagram","score":0.47368553280830383},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.46895140409469604},{"id":"https://openalex.org/keywords/power-diagram","display_name":"Power diagram","score":0.4573286771774292},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42852693796157837},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41903817653656006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4175068736076355},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4110243022441864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26264917850494385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23763415217399597},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12480407953262329},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12163764238357544}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8479440212249756},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.7062525749206543},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6886921525001526},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6224424839019775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6059973835945129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.476071298122406},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.47368553280830383},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.46895140409469604},{"id":"https://openalex.org/C20573064","wikidata":"https://www.wikidata.org/wiki/Q13410436","display_name":"Power diagram","level":3,"score":0.4573286771774292},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42852693796157837},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41903817653656006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4175068736076355},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4110243022441864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26264917850494385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23763415217399597},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12480407953262329},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12163764238357544},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140959067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140959067","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G1399298775","display_name":"AF: Small: Approximation, Covering and Clustering in Computational Geometry","funder_award_id":"0915984","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5118323806","display_name":null,"funder_award_id":"CCF-0915984","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6271038849","display_name":"AF: Small:  Efficient Proximity and Similarity Search in Computational Geometry","funder_award_id":"1217462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7864877588","display_name":null,"funder_award_id":"CCF-1217462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1997744504","https://openalex.org/W2007273639","https://openalex.org/W2016400774","https://openalex.org/W2037877878","https://openalex.org/W2038276547","https://openalex.org/W2049480565","https://openalex.org/W2054011861","https://openalex.org/W2061845601","https://openalex.org/W2093149131","https://openalex.org/W2397770138","https://openalex.org/W2427881153","https://openalex.org/W4235042979"],"related_works":["https://openalex.org/W1990256178","https://openalex.org/W2389383186","https://openalex.org/W2039506401","https://openalex.org/W2130912035","https://openalex.org/W2949156817","https://openalex.org/W2378511107","https://openalex.org/W2006448653","https://openalex.org/W4292290785","https://openalex.org/W50790158","https://openalex.org/W2174417008"],"abstract_inverted_index":{"We":[0,15],"investigate":[1],"the":[2,29,52,60,83,105],"classes":[3],"of":[4,32,55,90,110],"functions":[5,100,112],"whose":[6],"minimization":[7,30],"diagrams":[8],"can":[9,24,43],"be":[10,25],"approximated":[11],"efficiently":[12],"in":[13,46],"$\\mathbb{R}^d$.":[14],"present":[16],"a":[17,21,88],"general":[18,67],"framework":[19,95],"and":[20,42,82],"data-structure":[22,37],"that":[23,101],"used":[26],"to":[27,87],"approximate":[28],"diagram":[31,54],"such":[33,74],"functions.":[34,69],"The":[35],"resulting":[36],"has":[38],"near":[39,114],"linear":[40,115],"size":[41,116],"answer":[44],"queries":[45],"logarithmic":[47],"time.":[48],"Applications":[49],"include":[50],"approximating":[51],"Voronoi":[53],"multiplicatively":[56],"weighted":[57],"points,":[58],"but":[59],"new":[61],"technique":[62],"also":[63,96],"works":[64,97],"for":[65,76,98],"more":[66],"distance":[68,86,99],"For":[70,108],"example,":[71],"we":[72],"get":[73],"data-structures":[75],"metrics":[77],"induced":[78],"by":[79],"convex":[80],"bodies,":[81],"nearest":[84],"furthest-neighbor":[85],"set":[89],"point":[91],"sets.":[92],"Interestingly,":[93],"our":[94],"do":[102],"not":[103],"obey":[104],"triangle":[106],"inequality.":[107],"many":[109],"these":[111],"no":[113],"approximation":[117],"was":[118],"known":[119],"before.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}