The complexity and construction of many faces in arrangements of lines and of segments

1990/03/01 by Herbert Edelsbrunner, Leonidas Guibas, Leonidas J. Guibas +1 · 4 citations
Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Mathematics #Point processes and geometric inequalities

paper · pdf · doi:10.1007/bf02187784

crossref issued 1990/03/01 · crossref published 1990/03/01 · crossref published-online 1990/03/01 · crossref published-print 1990/03/01 · openalex publication_date 1990/03/01 · crossref created 2005/09/20 · crossref deposited 2020/04/09 · openalex created_date 2025/10/10 · crossref indexed 2026/05/14 · openalex updated_date 2026/07/23

Citations

• On k-Hulls and Related Problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• A theorem on arrangements of lines in the plane
• Constructing Arrangements of Lines and Hyperplanes with Applications

Cited by

• Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
• Partitioning arrangements of lines I: An efficient deterministic algorithm
• Geometric Lower Bounds for Parametric Matroid Optimization
• Arrangement of lines [wikipedia]