SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.
XX:16 OntheDoublingDimensionandthePerimeterofGeodesicallyConvexSetsinFatPolygons 4 Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
(α,β)-covered polygons have bounded doubling dimension and geodesically convex sets have perimeter O(diameter), enabling O(n + m log n) expected-time closest-pair algorithm.
citing papers explorer
-
Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.
-
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
(α,β)-covered polygons have bounded doubling dimension and geodesically convex sets have perimeter O(diameter), enabling O(n + m log n) expected-time closest-pair algorithm.