Quadtrees and related structures are 2-Presortable, admitting expected O(n sqrt(log n)) algorithms given presorts along both axes.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.
A graph-based technique splits ambiguous instances into multiple points in DR projections to reduce partial neighborhood embedding and reveal hidden memberships.
Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.
citing papers explorer
-
The Presort Hierarchy for Geometric Problems
Quadtrees and related structures are 2-Presortable, admitting expected O(n sqrt(log n)) algorithms given presorts along both axes.
-
Touring a Sequence of Orthogonal Polygons
Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.
-
When One Point Is Not Enough: Addressing Ambiguous Instances in Dimensionality Reduction by Splitting
A graph-based technique splits ambiguous instances into multiple points in DR projections to reduce partial neighborhood embedding and reveal hidden memberships.
-
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.