{"id":"https://openalex.org/W7140314667","doi":"https://doi.org/10.1145/3802821","title":"Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain","display_name":"Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain","publication_year":2026,"publication_date":"2026-03-25","ids":{"openalex":"https://openalex.org/W7140314667","doi":"https://doi.org/10.1145/3802821"},"language":"en","primary_location":{"id":"doi:10.1145/3802821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3802821","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5130023495","display_name":"Sarita de Berg","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sarita de Berg","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The\u00a0Netherlands and IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5555-966X","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The\u00a0Netherlands and IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077251333","display_name":"Tillmann Miltzow","orcid":"https://orcid.org/0000-0003-4563-2864"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Tillmann Miltzow","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-4563-2864","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130554568","display_name":"Frank Staals","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frank Staals","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0004-8522-1351","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2642063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"3","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5979999899864197,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5979999899864197,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.1257999986410141,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09179999679327011,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.5403000116348267},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5335000157356262},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4650000035762787},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.450300008058548},{"id":"https://openalex.org/keywords/spatial-query","display_name":"Spatial query","score":0.44519999623298645},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4383000135421753},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43540000915527344},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43470001220703125}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5403000116348267},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5110999941825867},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4650000035762787},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.44519999623298645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4408000111579895},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43540000915527344},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.423799991607666},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39480000734329224},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.39089998602867126},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.3878999948501587},{"id":"https://openalex.org/C96956885","wikidata":"https://www.wikidata.org/wiki/Q6138701","display_name":"RDF query language","level":5,"score":0.35089999437332153},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.326200008392334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3203999996185303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29600000381469727},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27900001406669617},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.2777999937534332},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.2678000032901764}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3802821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3802821","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2692702462","display_name":"Solving Continuous Problems with Guarantees","funder_award_id":"VI.Vidi.213.150","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W596522316","https://openalex.org/W1504893535","https://openalex.org/W1992176147","https://openalex.org/W2011387411","https://openalex.org/W2019524783","https://openalex.org/W2038636610","https://openalex.org/W2038699153","https://openalex.org/W2058510050","https://openalex.org/W2058889860","https://openalex.org/W2059155916","https://openalex.org/W2067631433","https://openalex.org/W2081751185","https://openalex.org/W2107704676","https://openalex.org/W2114914255","https://openalex.org/W2122121031","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2138769733","https://openalex.org/W2144713886","https://openalex.org/W2150256023","https://openalex.org/W2568603896","https://openalex.org/W2569574600","https://openalex.org/W3154375579","https://openalex.org/W4247939603","https://openalex.org/W4254977685"],"related_works":[],"abstract_inverted_index":{"We":[0],"devise":[1,113],"a":[2,16,55,74,88,108],"data":[3,38,89,114,134],"structure":[4,39,90],"that":[5],"can":[6,44,53,103],"answer":[7],"shortest":[8],"path":[9],"queries":[10,43],"for":[11,124,136],"two":[12],"query":[13,63,98,122,148,164,176,187,193,209],"points":[14,149,165,194],"in":[15,47],"polygonal":[17],"domain":[18],"\\(":[19,23,156],"P":[20,157],"\\)":[21,25,158],"on":[22,152,170,196],"n":[24],"vertices.":[26],"For":[27],"any":[28,125],"\\(\\varepsilon":[29],">":[30],"0\\)":[31],",":[32,214],"the":[33,37,62,70,137,147,153,163,171,174,180,186,197,199,208],"space":[34,56,93,118,181,200],"complexity":[35,57,94,119,182,201],"of":[36,58,146,155,162,220],"is":[40,69,166,178,202],"\\(O(n^{10+\\varepsilon})\\)":[41],"and":[42,79,95,120,173,185,207,222],"be":[45,104],"answered":[46],"\\(O(\\log":[48,96,212],"n)\\)":[49,97,213],"time.":[50,99],"Alternatively,":[51],"we":[52,112,131,141],"achieve":[54],"\\(O(n^{9+\\varepsilon})\\)":[59],"by":[60,77],"relaxing":[61],"time":[64,188,210],"to":[65,106,150,168,205,211],"\\(O(\\log^{2}n)\\)":[66,189],".":[67,129,159,190],"This":[68],"first":[71],"improvement":[72],"upon":[73],"conference":[75],"paper":[76],"Chiang":[78],"Mitchell":[80],"[":[81],"15":[82],"]":[83],"from":[84],"1999.":[85],"They":[86],"present":[87,132],"with":[91,116],"\\(O(n^{11})\\)":[92],"Our":[100],"main":[101],"result":[102,219],"extended":[105],"include":[107],"space-time":[109],"tradeoff.":[110],"Specifically,":[111],"structures":[115,135],"\\(O(n^{9+\\varepsilon}/\\ell^{4+O(\\varepsilon)})\\)":[117],"\\(O(\\ell\\log^{2}n)\\)":[121],"time,":[123],"integer":[126],"\\(1\\leq\\ell\\leq":[127],"n\\)":[128],"Furthermore,":[130],"improved":[133],"special":[138],"case":[139],"where":[140],"restrict":[142],"one":[143,161],"(or":[144],"both)":[145],"lie":[151,169],"boundary":[154],"When":[160,191],"restricted":[167],"boundary,":[172,198],"other":[175],"point":[177],"unrestricted,":[179],"becomes":[183],"\\(O(n^{6+\\varepsilon})\\)":[184],"both":[192],"are":[195],"decreased":[203],"further":[204],"\\(O(n^{4+\\varepsilon})\\)":[206],"thereby":[215],"improving":[216],"an":[217],"earlier":[218],"Bae":[221],"Okamoto.":[223]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-03-26T00:00:00"}