Pages that link to "Item:Q3069906"

The following pages link to Almost tight upper bounds for vertical decompositions in four dimensions (Q3069906):

Displaying 23 items.

• Sharp bounds for vertical decompositions of linear arrangements in four dimensions (Q701796) (← links)
• Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
• Semi-algebraic Ramsey numbers (Q896011) (← links)
• Separating bichromatic point sets by L-shapes (Q904108) (← links)
• Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
• Computing the Betti numbers of arrangements via spectral sequences (Q1886454) (← links)
• Vertical decomposition of arrangements of hyperplanes in four dimensions (Q1895966) (← links)
• Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
• Nondegenerate spheres in four dimensions (Q2167310) (← links)
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
• The Schur-Erdős problem for semi-algebraic colorings (Q2204399) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
• Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
• (Q5088930) (← links)
• (Q5088966) (← links)
• (Q5136216) (← links)
• OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
• Optimal Triangulation with Steiner Points (Q5387801) (← links)
• Geometric optimization and sums of algebraic functions (Q5501958) (← links)