Pages that link to "Item:Q4016895"
From MaRDI portal
The following pages link to RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (Q4016895):
Displaying 15 items.
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Can a randomized binary search have an \(O(1)\) complexity at least in practice? (Q2383711) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS (Q3520431) (← links)
- Dog Bites Postman (Q4513211) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- (Q5075759) (← links)
- AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
- Fast skeleton construction (Q6102331) (← links)
- Finding the medial axis of a simple polygon in linear time (Q6487986) (← links)
