Almost tight upper bounds for vertical decompositions in four dimensions
From MaRDI portal
(Redirected from Almost tight upper bounds for vertical decompositions in four dimensions)
Recommendations
- scientific article; zbMATH DE number 1830725
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions
- Vertical decomposition of arrangements of hyperplanes in four dimensions
- Bounds on the size of tetrahedralizations
- scientific article; zbMATH DE number 851660
- A tight bound on the projective dimension of four quadrics
- Four-dimensional polytopes of minimum positive semidefinite rank
- Four-dimensional analogues of Dehn's lemma
- scientific article; zbMATH DE number 1312888
- An Improved Bound for k-Sets in Four Dimensions
Cited in
(37)- Smoothed analysis of probabilistic roadmaps
- Computing the Betti numbers of arrangements via spectral sequences
- Vertical decomposition of arrangements of hyperplanes in four dimensions
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Nondegenerate spheres in four dimensions
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- The Schur-Erdős problem for semi-algebraic colorings
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic geometric data structures via shallow cuttings
- Faster algorithms for growing prioritized disks and rectangles
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Computing Envelopes in Four Dimensions with Applications
- Improved construction of vertical decompositions of three-dimensional arrangements
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- scientific article; zbMATH DE number 1830725 (Why is no real title available?)
- scientific article; zbMATH DE number 2119742 (Why is no real title available?)
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- An efficient algorithm for generalized polynomial partitioning and its applications
- Semi-algebraic colorings of complete graphs
- scientific article; zbMATH DE number 7278008 (Why is no real title available?)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
- Optimal Triangulation with Steiner Points
- Geometric optimization and sums of algebraic functions
- Combinatorial bounds in distal structures
- On k-enclosing slab problems
- Dynamic geometric connectivity in the plane with constant query time
- Towards space efficient two-point shortest path queries in a polygonal domain
- Combinatorial characterizations and algorithms for trajectory planning of an articulated robotic probe in three dimensions
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions
- Line intersection searching amid unit balls in 3-space
- Lower envelopes of surface patches in 3-space
- Sparse bounded hop-spanners for geometric intersection graphs
- Towards space efficient two-point shortest path queries in a polygonal domain
- Cuttings for disks and axis-aligned rectangles in three-space
- Semi-algebraic Ramsey numbers
- Separating bichromatic point sets by L-shapes
This page was built for publication: Almost tight upper bounds for vertical decompositions in four dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069906)
