Pages that link to "Item:Q1820582"
From MaRDI portal
The following pages link to New applications of random sampling in computational geometry (Q1820582):
Displaying 50 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Randomized quickhull (Q675302) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Pointwise constraints in vector-valued Sobolev spaces. With applications in optimal control (Q722070) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Clamshell casting (Q1031870) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Finding stabbing lines in 3-space (Q1193706) (← 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)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- On vertical ray shooting in arrangements (Q1803272) (← links)
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces (Q1816466) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
