Pages that link to "Item:Q1823686"
From MaRDI portal
The following pages link to A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686):
Displaying 11 items.
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
- Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA (Q5470166) (← links)
