Convex subdivisions with low stabbing numbers

DOI10.1007/s10998-008-8217-7zbMath1199.05036OpenAlexW2045363075MaRDI QIDQ1046805

Csaba D. Tóth

Publication date: 29 December 2009

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-008-8217-7

zbMATH Keywords

space partitionconvex subdivisionstabbing numberextremal bound

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Extremal combinatorics (05D99)

Related Items (3)

Stabbing convex subdivisions with \(k\)-flats ⋮ Moser's shadow problem ⋮ Monotone Paths in Planar Convex Subdivisions and Polytopes

Cites Work

• Stabbing Delaunay tetrahedralizations
• On the stabbing number of a random Delaunay triangulation
• The complexity of cutting complexes
• Efficient partition trees
• Approximating minimum-weight triangulations in three dimensions
• Rectilinear decompositions with low stabbing number
• Extremal problems for geometric hypergraphs
• Cost-driven octree construction schemes: An experimental study
• Quasi-optimal range searching in spaces of finite VC-dimension
• Axis-Aligned Subdivisions with Low Stabbing Numbers
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex subdivisions with low stabbing numbers