{"id":"https://openalex.org/W2107704676","doi":"https://doi.org/10.1142/s0218195901000675","title":"ON GEOMETRIC PATH QUERY PROBLEMS","display_name":"ON GEOMETRIC PATH QUERY PROBLEMS","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2107704676","doi":"https://doi.org/10.1142/s0218195901000675","mag":"2107704676"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195901000675","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195901000675","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/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"DANNY Z. CHEN","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078438902","display_name":"Ovidiu Daescu","orcid":"https://orcid.org/0000-0002-0278-4174"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"OVIDIU DAESCU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Ricardson, TX 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Ricardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069224332","display_name":"Kevin S. Klenk","orcid":null},"institutions":[{"id":"https://openalex.org/I1292974536","display_name":"Ford Motor Company (United States)","ror":"https://ror.org/00g2tkw06","country_code":"US","type":"company","lineage":["https://openalex.org/I1292974536"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"KEVIN S. KLENK","raw_affiliation_strings":["Ford Motor Company, Dearborn, MI 48101, USA"],"affiliations":[{"raw_affiliation_string":"Ford Motor Company, Dearborn, MI 48101, USA","institution_ids":["https://openalex.org/I1292974536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060901632"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.18154463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"06","first_page":"617","last_page":"645"},"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.9998000264167786,"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.9998000264167786,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9958000183105469,"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/polygon","display_name":"Polygon (computer graphics)","score":0.6982191205024719},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6260870695114136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6238341927528381},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6233342885971069},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5726487636566162},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4772198796272278},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.47591549158096313},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4494639039039612},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.4464183449745178},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.42555394768714905},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.425215482711792},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3785495162010193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3190385103225708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31788063049316406},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1521860659122467}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6982191205024719},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6260870695114136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6238341927528381},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6233342885971069},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5726487636566162},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4772198796272278},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.47591549158096313},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4494639039039612},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.4464183449745178},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.42555394768714905},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.425215482711792},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3785495162010193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3190385103225708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31788063049316406},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1521860659122467},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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":1,"locations":[{"id":"doi:10.1142/s0218195901000675","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195901000675","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1975595599","https://openalex.org/W1982180670","https://openalex.org/W1992176147","https://openalex.org/W2004884735","https://openalex.org/W2020449301","https://openalex.org/W2058510050","https://openalex.org/W2063372577","https://openalex.org/W2067943142","https://openalex.org/W2080239516","https://openalex.org/W2094327497","https://openalex.org/W2100008148","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2149620120","https://openalex.org/W2170905079"],"related_works":["https://openalex.org/W2012974186","https://openalex.org/W2075509416","https://openalex.org/W2088485107","https://openalex.org/W53644101","https://openalex.org/W2992237813","https://openalex.org/W2019903130","https://openalex.org/W3198543556","https://openalex.org/W2895069531","https://openalex.org/W2565630656","https://openalex.org/W2107704676"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,24,112],"study":[4],"several":[5,64,119],"geometric":[6,61,125],"path":[7,37],"query":[8,47,146],"problems.":[9],"Given":[10],"a":[11,79,98],"scene":[12],"of":[13,33,71,85,96,101,139],"disjoint":[14],"polygonal":[15],"obstacles":[16],"with":[17,76],"totally":[18],"n":[19],"vertices":[20],"in":[21,55,105],"the":[22,94,106,110,132,137,140],"plane,":[23],"construct":[25],"efficient":[26,116],"data":[27],"structures":[28],"that":[29,52,108],"enable":[30],"fast":[31],"reporting":[32],"an":[34,56],"\"optimal\"":[35],"obstacle-avoiding":[36],"(or":[38],"its":[39],"length,":[40,69],"cost,":[41],"directions,":[42],"etc)":[43],"between":[44],"two":[45],"arbitrary":[46],"points":[48,104],"s":[49],"and":[50,82,87],"t":[51],"are":[53,91],"given":[54],"on-line":[57],"fashion.":[58],"We":[59,114,127],"consider":[60],"paths":[62,111],"under":[63],"optimality":[65],"criteria:":[66],"L":[67],"m":[68],"number":[70,100],"edges":[72],"(called":[73],"links),":[74],"monotonicity":[75],"respect":[77],"to":[78],"certain":[80],"direction,":[81],"some":[83],"combinations":[84],"length":[86],"links.":[88],"Our":[89],"methods":[90],"centered":[92],"around":[93],"notion":[95],"gateways,":[97],"small":[99],"easily":[102],"identified":[103],"plane":[107],"control":[109],"seek.":[113],"give":[115],"solutions":[117,130],"for":[118,131,145],"special":[120],"cases":[121,134],"based":[122,135],"upon":[123,136],"new":[124],"observations.":[126],"also":[128],"present":[129],"general":[133],"computation":[138],"minimum":[141],"size":[142],"visibility":[143],"polygon":[144],"points.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-26T15:22:09.906841","created_date":"2025-10-10T00:00:00"}