{"id":"https://openalex.org/W7162579575","doi":"https://doi.org/10.4230/lipics.socg.2026.23","title":"Shortest Paths in Geodesic Unit-Disk Graphs","display_name":"Shortest Paths in Geodesic Unit-Disk Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162579575","doi":"https://doi.org/10.4230/lipics.socg.2026.23"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25829","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.23/LIPIcs.SoCG.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.23/LIPIcs.SoCG.2026.23.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137127011","display_name":"Bruce W. Brewer","orcid":"https://orcid.org/0009-0008-2995-148X"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brewer, Bruce W.","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA"],"raw_orcid":"https://orcid.org/0009-0008-2995-148X","affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137171075","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0001-8134-7409"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wang, Haitao","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA"],"raw_orcid":"https://orcid.org/0000-0001-8134-7409","affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63591022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9682999849319458,"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.9682999849319458,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.0044999998062849045,"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"}},{"id":"https://openalex.org/T10304","display_name":"Geometric and Algebraic Topology","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.7990000247955322},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6452999711036682},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5404000282287598},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.536899983882904},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5163999795913696},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4429999887943268},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.38199999928474426},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.3750999867916107},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34389999508857727}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8306000232696533},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.7990000247955322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7461000084877014},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6452999711036682},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5404000282287598},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.536899983882904},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5163999795913696},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4429999887943268},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41440001130104065},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.38199999928474426},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.3750999867916107},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.32919999957084656},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.30219998955726624},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2874000072479248},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.27090001106262207},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.26440000534057617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25829","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.23/LIPIcs.SoCG.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.23","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.23","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25829","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.23/LIPIcs.SoCG.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162579575.pdf","grobid_xml":"https://content.openalex.org/works/W7162579575.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"S":[1,22,26],"be":[2],"a":[3,9,71,114,156],"set":[4,25],"of":[5,81,90,95],"n":[6,164,166,179,181],"points":[7],"in":[8,38,61,127],"polygon":[10],"P":[11,39,154],"with":[12,195],"m":[13],"vertices.":[14],"The":[15],"geodesic":[16,36,56],"unit-disk":[17],"graph":[18],"G(S)":[19,109,132],"induced":[20],"by":[21],"has":[23,67,100],"vertex":[24],"and":[27,111,188],"contains":[28],"an":[29,161,176,189],"edge":[30,49,66],"between":[31,58],"two":[32],"vertices":[33,89],"whenever":[34],"their":[35],"distance":[37,57],"is":[40,50,155],"at":[41],"most":[42],"one.":[43],"In":[44,137],"the":[45,55,62,79,93,128,142,150,171],"weighted":[46,151],"version,":[47,64],"each":[48],"assigned":[51],"weight":[52,68],"equal":[53],"to":[54,87],"its":[59],"endpoints;":[60],"unweighted":[63,172],"every":[65],"1.":[69],"Given":[70],"source":[72],"point":[73],"s":[74,86],"\u2208":[75],"S,":[76],"we":[77,140,159,174],"study":[78],"problem":[80,99],"computing":[82],"shortest":[83,116],"paths":[84],"from":[85],"all":[88],"G(S).":[91],"To":[92],"best":[94],"our":[96],"knowledge,":[97],"this":[98,123,138,147],"not":[101],"been":[102],"investigated":[103],"previously.":[104],"A":[105],"naive":[106],"approach":[107],"constructs":[108],"explicitly":[110],"then":[112],"applies":[113],"standard":[115],"path":[117],"algorithm":[118,184,192],"for":[119,146,185,193],"general":[120],"graphs,":[121],"but":[122],"requires":[124],"quadratic":[125],"time":[126],"worst":[129],"case,":[130,152,173],"since":[131],"may":[133],"contain":[134],"\u03a9(n\u00b2)":[135],"edges.":[136],"paper,":[139],"give":[141],"first":[143],"subquadratic-time":[144],"algorithms":[145],"problem.":[148],"For":[149,170],"when":[153],"simple":[157,186],"polygon,":[158],"obtain":[160],"O(m":[162,177],"+":[163,178],"log\u00b3":[165],"log\u00b2":[167,182],"m)-time":[168,183],"algorithm.":[169],"provide":[175],"log":[180],"polygons,":[187],"O(\u221an":[190],"(n+m)log(n+m))-time":[191],"polygons":[194],"holes.":[196]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}