Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.
7 Bernard Chazelle
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
Improved space-time tradeoffs for visibility polygon queries: O(n^{2+ε}) space for O(log n + k) time, plus better bounds in other regimes using a new polygon decomposition.
citing papers explorer
-
Implicit representations via the polynomial method
Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.
-
Visibility Queries in Simple Polygons
Improved space-time tradeoffs for visibility polygon queries: O(n^{2+ε}) space for O(log n + k) time, plus better bounds in other regimes using a new polygon decomposition.