A single cell in an arrangement of convex polyhedra in R^3

DOI10.1007/S00454-006-1272-9MaRDI QIDQ866969zbMATH OpenOpenAlexFDO

Authors Esther Ezra, Micha Sharir

Publication date 14 February 2007

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

Full work available at URL https://doi.org/10.1007/s00454-006-1272-9

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Recommendations

• Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
• Almost tight upper bounds for the single cell and zone problems in the three dimensions
• The complexity of cells in three-dimensional arrangements
• The Union of Convex Polyhedra in Three Dimensions
• Triangles in space or building (and analyzing) castles in the air

Cited in

(10)

• Polytopes in arrangements
• The Union of Convex Polyhedra in Three Dimensions
• Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
• An acyclicity theorem for cell complexes in d dimensions
• scientific article; zbMATH DE number 895791 (Why is no real title available?)
• Cells in any simple polygon formed by a planar point set
• Almost tight upper bounds for the single cell and zone problems in the three dimensions
• Complexity of projected images of convex subdivisions
• Triangles in space or building (and analyzing) castles in the air
• A Handlebody with One Pillbox has no Fake 3-Cells

This page was built for publication: A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866969)