On Levels in Arrangements of Curves

2003/02/10 by Timothy M. Chan · 2 citations
Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Degree (music) #Discrete mathematics #Geometry #Graph #Mathematical analysis #Mathematical proof #Mathematics #Pairwise comparison #Planar #Planar graph #Point processes and geometric inequalities #Polynomial #Simple (philosophy) #Upper and lower bounds

paper · pdf · doi:10.1007/s00454-002-2840-2

openalex publication_date 2003/02/10 · crossref created 2003/02/10 · crossref issued 2003/02/13 · crossref published 2003/02/13 · crossref published-print 2003/02/13 · crossref deposited 2019/05/28 · crossref indexed 2025/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Allowable Sequences and Order Types in Discrete and Computational Geometry
• The number of small semispaces of a finite set of points in the plane
• Geometric Lower Bounds for Parametric Matroid Optimization
• Algorithms for ham-sandwich cuts
• An Improved Bound for k-Sets in Three Dimensions

Cited by

• On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
• K-set (geometry) [wikipedia]