Derives information-theoretic recovery thresholds for two intersecting lines with polynomial mass concentration near the intersection and matches them (up to polylog factors) via a spectral algorithm on a hypergraph built from nearly collinear triples.
Discrete & Computational Geometry 24(1), 61–84 (2000)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Consistent line clustering using geometric hypergraphs
Derives information-theoretic recovery thresholds for two intersecting lines with polynomial mass concentration near the intersection and matches them (up to polylog factors) via a spectral algorithm on a hypergraph built from nearly collinear triples.