Pages that link to "Item:Q1823685"
From MaRDI portal
The following pages link to Applications of random sampling in computational geometry. II (Q1823685):
Displaying 50 items.
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Kinetic hanger (Q1029070) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- Points and triangles in the plane and halving planes in space (Q1176320) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Repeated angles in the plane and related problems (Q1185877) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Seven fingers allow force-torque closure grasps on any convex polyhedron (Q1209736) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- On the randomized construction of the Delaunay tree (Q1210297) (← links)
- The widest k-dense corridor problems (Q1274672) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- An invariant property of balls in arrangements of hyperplanes (Q1312192) (← links)
- A bound on local minima of arrangements that implies the upper bound theorem (Q1312194) (← links)
- Arrangements of oriented hyperplanes (Q1312195) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- \(k\)-sets and random hulls (Q1316654) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- On the sum of squares of cell complexities in hyperplane arrangements (Q1320395) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Castles in the air revisited (Q1334929) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Indexing moving points (Q1394801) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
