Pages that link to "Item:Q1177933"

The following pages link to A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933):

Displaying 36 items.

• On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
• Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
• Semi-algebraic Ramsey numbers (Q896011) (← links)
• Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
• Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
• Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
• Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces (Q1275661) (← links)
• On range searching with semialgebraic sets (Q1329188) (← links)
• New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
• The complexity of stratification computation (Q1380787) (← links)
• A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
• Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
• Computing the Betti numbers of arrangements via spectral sequences (Q1886454) (← links)
• Vertical decomposition of arrangements of hyperplanes in four dimensions (Q1895966) (← links)
• Motion planning via manifold samples (Q2017878) (← links)
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
• Nondegenerate spheres in four dimensions (Q2167310) (← links)
• The Schur-Erdős problem for semi-algebraic colorings (Q2204399) (← links)
• How to find groups? (Q2250822) (← links)
• Cutting lemma and Zarankiewicz's problem in distal structures (Q2307522) (← links)
• Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
• Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
• A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
• An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
• A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
• Straight-path queries in trajectory data (Q2634714) (← links)
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
• (Q3975182) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• (Q5088930) (← links)
• (Q5088966) (← links)
• Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
• Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
• Geometric pattern matching in d-dimensional space (Q6102306) (← links)
• Throwing a sofa through the window (Q6142343) (← links)
• Decomposing the complement of the union of cubes and boxes in three dimensions (Q6624162) (← links)