Improved Bounds for Planar k -Sets and Related Problems

1998/03/01 by T. K. Dey, Tuli Dey · 9 citations
Computer Science · Environmental Science · #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Remote Sensing and LiDAR Applications

paper · pdf · doi:10.1007/pl00009354

crossref issued 1998/03/01 · crossref published 1998/03/01 · crossref published-print 1998/03/01 · openalex publication_date 1998/03/01 · crossref created 2006/02/10 · crossref deposited 2019/05/22 · openalex created_date 2025/10/10 · crossref indexed 2026/07/08 · openalex updated_date 2026/07/29

Citations

• Combinatorial complexity bounds for arrangements of curves and spheres

Cited by

• Point Sets with Many k-Sets
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• An Improved Bound for k-Sets in Three Dimensions
• A Stronger Lower Bound on Parametric Minimum Spanning Trees
• On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
• Combinatorial foundations for geometric realizations of subword complexes of Coxeter groups
• Arrangement of lines [wikipedia]
• K-set (geometry) [wikipedia]
• List of unsolved problems in mathematics [wikipedia]