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.
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Untangling planar curves (Q1688858) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces (Q1816466) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Abstract Voronoi diagram in 3-space (Q1878678) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- The overlay of lower envelopes and its applications (Q1907607) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Incremental topological flipping works for regular triangulations (Q1908263) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Witnessed \(k\)-distance (Q1942306) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- A quick negative selection algorithm for one-class classification in big data era (Q1992686) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Union of hypercubes and 3D Minkowski sums with random sizes (Q2022617) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- On circles enclosing many points (Q2043403) (← links)
- Dimensionality reduction for \(k\)-distance applied to persistent homology (Q2063202) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
