Almost tight upper bounds for vertical decompositions in four dimensions
From MaRDI portal
Publication:3069906
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
(28)- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- scientific article; zbMATH DE number 7278008 (Why is no real title available?)
- Nondegenerate spheres in four dimensions
- Semi-algebraic Ramsey numbers
- Computing Envelopes in Four Dimensions with Applications
- Faster algorithms for growing prioritized disks and rectangles
- Computing the Betti numbers of arrangements via spectral sequences
- scientific article; zbMATH DE number 1830725 (Why is no real title available?)
- Separating bichromatic point sets by L-shapes
- scientific article; zbMATH DE number 7559236 (Why is no real title available?)
- Vertical decomposition of arrangements of hyperplanes in four dimensions
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- The Schur-Erdős problem for semi-algebraic colorings
- Dynamic geometric data structures via shallow cuttings
- Geometric optimization and sums of algebraic functions
- Improved construction of vertical decompositions of three-dimensional arrangements
- scientific article; zbMATH DE number 7559205 (Why is no real title available?)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Cuttings for disks and axis-aligned rectangles in three-space
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions
- Optimal Triangulation with Steiner Points
- Smoothed analysis of probabilistic roadmaps
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- scientific article; zbMATH DE number 2119742 (Why is no real title available?)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
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)
