On levels in arrangements of surfaces in three dimensions

DOI10.1007/s00454-012-9428-2zbMath1455.52026MaRDI QIDQ443917

Timothy M. Chan

Publication date: 13 August 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-012-9428-2

zbMATH Keywords

arrangements; \(k\)-level; The \(k\)-set problem

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

52C30: Planar arrangements of lines and pseudolines (aspects of discrete geometry)

52C45: Combinatorial complexity of geometric structures

Related Items

Unnamed Item, On the complexity of the \(k\)-level in arrangements of pseudoplanes, On the arrangement of stochastic lines in \(\mathbb{R}^2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-sets in four dimensions
• Points and triangles in the plane and halving planes in space
• The colored Tverberg's problem and complexes of injective functions
• Improved bounds for intersecting triangles and halving planes
• Counting triangle crossings and halving planes
• How to cut pseudoparabolas into segments
• On levels in arrangements of lines, segments, planes, and triangles
• Improved bounds for planar \(k\)-sets and related problems
• On levels in arrangements of curves
• \(k\)-levels of concave surfaces
• Optimal bounds for the colored Tverberg problem
• On levels in arrangements of curves. II: A simple inequality and its consequences
• Intersection reverse sequences and geometric applications.
• On the number of halving planes
• On the bichromatic k -set problem
• An Improved Bound for k-Sets in Four Dimensions
• On levels in arrangements of curves, iii
• Lenses in arrangements of pseudo-circles and their applications
• Point sets with many \(k\)-sets
• An improved bound for \(k\)-sets in three dimensions