Pages that link to "Item:Q751816"
From MaRDI portal
The following pages link to A deterministic view of random sampling and its use in geometry (Q751816):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Optimal partition trees (Q420575) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Near optimal bounds for the Erdős distinct distances problem in high dimensions (Q949786) (← links)
- A note on the number of different inner products generated by a finite set of vectors (Q966051) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Efficient partition trees (Q1199132) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- Indexing moving points (Q1394801) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- On vertical ray shooting in arrangements (Q1803272) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Bounding the piercing number (Q1892406) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- On separating points by lines (Q1985301) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- An Upper Bound on the k-Modem Illumination Problem (Q2792799) (← links)
