A fast Las Vegas algorithm for triangulating a simple polygon
From MaRDI portal
Publication:1823686
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- A fast Las Vegas algorithm for triangulating a simple polygon
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Applications of random sampling in computational geometry. II
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- New applications of random sampling in computational geometry
- Simplified linear-time Jordan sorting and polygon clipping
- Sorting jordan sequences in linear time using level-linked search trees
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon
- Triangulation and shape-complexity
- -nets and simplex range queries
Cited in
(11)- A fast Las Vegas algorithm for triangulating a simple polygon
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Triangulating a simple polygon in linear time
- Applications of random sampling in computational geometry. II
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Three problems about simple polygons
- Simplified linear-time Jordan sorting and polygon clipping
- An introduction to randomized algorithms
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
This page was built for publication: A fast Las Vegas algorithm for triangulating a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823686)
