Almost tight upper bounds for vertical decompositions in four dimensions
From MaRDI portal
Publication:3069906
DOI10.1145/1017460.1017461zbMath1204.68244OpenAlexW2150256023MaRDI QIDQ3069906
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items (20)
Computing the Betti numbers of arrangements via spectral sequences ⋮ Cuttings for disks and axis-aligned rectangles in three-space ⋮ OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS ⋮ Nondegenerate spheres in four dimensions ⋮ Semi-algebraic Ramsey numbers ⋮ Separating bichromatic point sets by L-shapes ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ 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 ⋮ Optimal Triangulation with Steiner Points ⋮ Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Smoothed analysis of probabilistic roadmaps ⋮ Unnamed Item ⋮ Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications ⋮ Faster algorithms for growing prioritized disks and rectangles ⋮ Geometric optimization and sums of algebraic functions ⋮ Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
This page was built for publication: Almost tight upper bounds for vertical decompositions in four dimensions
