{"id":"https://openalex.org/W1992176147","doi":"https://doi.org/10.1137/s0097539796307194","title":"Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane","display_name":"Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1992176147","doi":"https://doi.org/10.1137/s0097539796307194","mag":"1992176147"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796307194","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796307194","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/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danny Z. Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069224332","display_name":"Kevin S. Klenk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kevin S. Klenk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108351200","display_name":"Hung-Yi Tu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung-Yi T. Tu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1238,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.91401038,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"4","first_page":"1223","last_page":"1246"},"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.9833999872207642,"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/T12288","display_name":"Optimization and Search Problems","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8270200490951538},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.7453910112380981},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6445267200469971},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6393728256225586},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6254957318305969},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6154747605323792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5661113262176514},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5248822569847107},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49919748306274414},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4786197543144226},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47759175300598145},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4613627791404724},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43450629711151123},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3622429668903351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31635773181915283},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2471460998058319},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10545578598976135},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08977833390235901}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8270200490951538},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.7453910112380981},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6445267200469971},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6393728256225586},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6254957318305969},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6154747605323792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5661113262176514},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5248822569847107},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49919748306274414},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4786197543144226},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47759175300598145},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4613627791404724},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43450629711151123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3622429668903351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31635773181915283},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2471460998058319},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10545578598976135},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08977833390235901},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796307194","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796307194","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1975595599","https://openalex.org/W1981736066","https://openalex.org/W1985010089","https://openalex.org/W1989723858","https://openalex.org/W1992320342","https://openalex.org/W2004884735","https://openalex.org/W2029814178","https://openalex.org/W2032159439","https://openalex.org/W2038699153","https://openalex.org/W2049808842","https://openalex.org/W2051045196","https://openalex.org/W2057537033","https://openalex.org/W2058510050","https://openalex.org/W2062367161","https://openalex.org/W2063372577","https://openalex.org/W2084097355","https://openalex.org/W2084224084","https://openalex.org/W2094327497","https://openalex.org/W2114726496","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2147998016","https://openalex.org/W2167427782","https://openalex.org/W2170905079"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2375775343","https://openalex.org/W2347245430","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2161960576","https://openalex.org/W4321491762","https://openalex.org/W2384965074","https://openalex.org/W1974495461","https://openalex.org/W1992815517"],"abstract_inverted_index":{"We":[0,155],"study":[1],"the":[2,17,21,40,52,59,82,87,91,112,142,177],"problems":[3],"of":[4,42,54,84,114],"processing":[5,161,182],"single-source":[6,22],"and":[7,33,61,69,103,127,140],"two-point":[8,92,162,183],"shortest":[9,56,72,116,130,149,164,184],"path":[10,57,73,117,131,166,185],"queries":[11,167,186],"among":[12,151,168,187],"weighted":[13,152,188],"polygonal":[14,153,174],"obstacles":[15,175,189],"in":[16,29,65,74,99,123,132,176],"rectilinear":[18,148],"plane.":[19,178],"For":[20,90],"case,":[23,93],"we":[24,94],"construct":[25,95],"a":[26,55,96,115],"data":[27,46,97,106],"structure":[28,47,98,107],"O(nlog3/2n":[30],")":[31,125],"time":[32,102],"O(nlog":[34],"n)":[35,67],"space,":[36],"where":[37,79],"n":[38],"is":[39,81],"number":[41,83],"obstacle":[43],"vertices;":[44],"this":[45,105],"enables":[48,108],"us":[49,109],"to":[50,110,160],"report":[51,111],"length":[53,113],"between":[58,118],"source":[60],"any":[62],"query":[63,121],"point":[64],"O(log":[66,75],"time,":[68,78,126],"an":[70,128],"actual":[71,129],"n+":[76],"k)":[77,135],"k":[80],"edges":[85],"on":[86,146],"output":[88],"path.":[89],"O(n2":[100],"log2n)":[101],"space;":[104],"two":[119],"arbitrary":[120,169],"points":[122],"O(log2n":[124,133],"+":[134],"time.":[136],"Our":[137],"work":[138],"improves":[139],"generalizes":[141],"previously":[143,191],"best-known":[144],"results":[145],"computing":[147],"paths":[150],"obstacles.":[154],"also":[156],"apply":[157],"our":[158],"techniques":[159],"L1":[163],"obstacle-avoiding":[165],"(i.e.,":[170],"not":[171],"necessarily":[172],"rectilinear)":[173],"No":[179],"algorithm":[180],"for":[181],"was":[190],"known.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}