{"id":"https://openalex.org/W2054621199","doi":"https://doi.org/10.1137/0214034","title":"Intersection and Closest-Pair Problems for a Set of Planar Discs","display_name":"Intersection and Closest-Pair Problems for a Set of Planar Discs","publication_year":1985,"publication_date":"1985-05-01","ids":{"openalex":"https://openalex.org/W2054621199","doi":"https://doi.org/10.1137/0214034","mag":"2054621199"},"language":"en","primary_location":{"id":"doi:10.1137/0214034","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214034","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/A5055296785","display_name":"Micha Sharir","orcid":"https://orcid.org/0000-0002-2541-3763"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Micha Sharir","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055296785"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5268,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.91323529,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"448","last_page":"468"},"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental 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.9890000224113464,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.9196821451187134},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7997850179672241},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6316686272621155},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6294721364974976},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6250235438346863},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5095015168190002},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5024499893188477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4657253921031952},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4271199405193329},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.4102739691734314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3982144594192505},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37829869985580444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3282690644264221},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2453812062740326},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.12245258688926697},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06760075688362122}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9196821451187134},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7997850179672241},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6316686272621155},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6294721364974976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6250235438346863},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5095015168190002},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5024499893188477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4657253921031952},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4271199405193329},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.4102739691734314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3982144594192505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37829869985580444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3282690644264221},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2453812062740326},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.12245258688926697},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06760075688362122},{"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},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214034","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214034","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":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1874694348","https://openalex.org/W2001804342","https://openalex.org/W2015751084","https://openalex.org/W2033613927","https://openalex.org/W2047175801","https://openalex.org/W2068376033","https://openalex.org/W2126876121"],"related_works":["https://openalex.org/W2182952931","https://openalex.org/W2908074373","https://openalex.org/W2159782893","https://openalex.org/W2429103241","https://openalex.org/W2120293571","https://openalex.org/W1862650283","https://openalex.org/W71395815","https://openalex.org/W2962789953","https://openalex.org/W2108536469","https://openalex.org/W2042426695"],"abstract_inverted_index":{"Efficient":[0],"algorithms":[1],"for":[2,23,27,49],"detecting":[3],"intersections":[4],"and":[5,17,63],"computing":[6],"closest":[7],"neighbors":[8],"in":[9,58],"a":[10,45,50],"set":[11,51],"of":[12,29,32,38,44,52],"circular":[13,56],"discs,":[14],"are":[15],"presented":[16],"analyzed.":[18],"They":[19],"adapt":[20],"known":[21],"techniques":[22],"solving":[24],"these":[25],"problems":[26],"sets":[28],"points":[30],"or":[31],"line":[33],"segments.":[34],"The":[35],"main":[36],"portion":[37],"the":[39,42],"paper":[40],"contains":[41],"construction":[43],"generalized":[46],"Voronoi":[47],"diagram":[48],"n":[53],"(possibly":[54],"intersecting)":[55],"discs":[57],"time":[59],"$O(n\\log":[60],"^2":[61],"n)$,":[62],"its":[64],"applications.":[65]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}