Almost tight upper bounds for the single cell and zone problems in the three dimensions

Recommendations

Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
A single cell in an arrangement of convex polyhedra in R^3
The combinatorial and topological complexity of a single cell

Cites work

Almost tight upper bounds for lower envelopes in higher dimensions
Applications of random sampling in computational geometry. II
Arrangements of curves in the plane --- topology, combinatorics, and algorithms
Castles in the air revisited
Computing a Face in an Arrangement of Line Segments and Related Problems
Differential Topology
scientific article; zbMATH DE number 4029737 (Why is no real title available?)
scientific article; zbMATH DE number 4032498 (Why is no real title available?)
scientific article; zbMATH DE number 3572315 (Why is no real title available?)
scientific article; zbMATH DE number 203206 (Why is no real title available?)
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
On \(k\)-sets in arrangements of curves and surfaces
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
On the general motion-planning problem with two degrees of freedom
On the sum of squares of cell complexities in hyperplane arrangements
On the two-dimensional Davenport-Schinzel problem
On the zone of a surface in a hyperplane arrangement
On the Zone Theorem for Hyperplane Arrangements
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
The maximum numbers of faces of a convex polytope
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
Triangles in space or building (and analyzing) castles in the air
Vertical decompositions for triangles in 3-space

Cited in

(13)

Extremal problems on triangle areas in two and three dimensions
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
Almost tight upper bounds for lower envelopes in higher dimensions
Combinatorial complexity of translating a box in polyhedral 3-space
Computing the Betti numbers of arrangements via spectral sequences
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
Asymptotic number of \(\mathbb{Z}^3 \Delta\) cells covering \(\mathcal{C}^{(1)}\) surface on uniform grid and complexity of recursive-partitioning simulation of septal tissue regions
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
Robot motion planning
Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
On the union of cylinders in three dimensions
A single cell in an arrangement of convex polyhedra in R^3

This page was built for publication: Almost tight upper bounds for the single cell and zone problems in the three dimensions

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