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.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Efficient and robust persistent homology for measures (Q340536) (← links)
- Topological relations between separating circles (Q387873) (← links)
- Optimal partition trees (Q420575) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Certifying algorithms (Q465678) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Bold graph drawings (Q654288) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Randomized quickhull (Q675302) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Semi-algebraic Ramsey numbers (Q896011) (← links)
- An optimal generalization of the colorful Carathéodory theorem (Q906475) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Higher-order Voronoi diagrams on triangulated surfaces (Q987784) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- Depth of segments and circles through points enclosing many points: A note (Q1005330) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
