{"id":"https://openalex.org/W2019110091","doi":"https://doi.org/10.1007/bf02523193","title":"Proximity problems for points on a rectilinear plane with rectangular obstacles","display_name":"Proximity problems for points on a rectilinear plane with rectangular obstacles","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2019110091","doi":"https://doi.org/10.1007/bf02523193","mag":"2019110091"},"language":"en","primary_location":{"id":"doi:10.1007/bf02523193","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523193","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5071056532","display_name":"S. Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Guha","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Wisconsin-Milwaukee, 53201, Milwaukee, WI, USA","Electrical Engineering & Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Wisconsin-Milwaukee, 53201, Milwaukee, WI, USA","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Electrical Engineering & Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, USA","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101685359","display_name":"Ippei Suzuki","orcid":"https://orcid.org/0009-0008-0013-059X"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Suzuki","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Wisconsin-Milwaukee, 53201, Milwaukee, WI, USA","Electrical Engineering & Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Wisconsin-Milwaukee, 53201, Milwaukee, WI, USA","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Electrical Engineering & Computer Science Department, University of Wisconsin-Milwaukee, Milwaukee, USA","institution_ids":["https://openalex.org/I43579087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.2005,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86351128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":"3","first_page":"281","last_page":"307"},"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.9968000054359436,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.8333852291107178},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6901774406433105},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6707510948181152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6129551529884338},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5551363825798035},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.484548956155777},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46441027522087097},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4641816020011902},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4536433219909668},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43999454379081726},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43779534101486206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4234643280506134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4011376202106476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22610872983932495},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1481975018978119},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14565902948379517}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8333852291107178},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6901774406433105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6707510948181152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6129551529884338},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5551363825798035},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.484548956155777},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46441027522087097},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4641816020011902},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4536433219909668},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43999454379081726},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43779534101486206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4234643280506134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4011376202106476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22610872983932495},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1481975018978119},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14565902948379517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf02523193","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523193","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.5845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.5845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ait.ac.th/~guha/papers/proximityProblems.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.1736","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwm.edu/faculty/guha/papers/algorithmica.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W38524751","https://openalex.org/W1975595599","https://openalex.org/W1979832172","https://openalex.org/W1992320342","https://openalex.org/W2005314985","https://openalex.org/W2007610503","https://openalex.org/W2009218627","https://openalex.org/W2048422125","https://openalex.org/W2050394746","https://openalex.org/W2062367161","https://openalex.org/W2063372577","https://openalex.org/W2084529282","https://openalex.org/W2126876121","https://openalex.org/W2128865241","https://openalex.org/W2132339863","https://openalex.org/W2146919520","https://openalex.org/W2147998016","https://openalex.org/W2150518053","https://openalex.org/W2160517890","https://openalex.org/W2163030926","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W4206942348","https://openalex.org/W2151139361","https://openalex.org/W2175621835","https://openalex.org/W2565630656","https://openalex.org/W2118561828","https://openalex.org/W2187533684","https://openalex.org/W1514742182","https://openalex.org/W2572134342","https://openalex.org/W2019110091","https://openalex.org/W4244080821"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}