Almost tight upper bounds for vertical decompositions in four dimensions

DOI10.1145/1017460.1017461zbMATH Open1204.68244OpenAlexW2150256023MaRDI QIDQ3069906FDOQ3069906

Publication date: 1 February 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1017460.1017461

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

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cited In (28)

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

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)