Randomly generating triangulations of a simple polygon
From MaRDI portal
Recommendations
- Generating triangulations at random
- A randomized algorithm for triangulating a simple polygon in linear time
- scientific article; zbMATH DE number 1241390
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems
- Properties of random triangulations and trees
Cited in
(17)- Random triangulations of the plane
- Properties of random triangulations and trees
- Generating random polygons with given vertices
- On typical triangulations of a convex \(n\)-gon
- Counting polygon triangulations is hard
- Use of simple polygonal chains in generating random simple polygons
- Generating strictly binary trees at random based on convex polygon triangulations
- GRP_CH Heuristic for Generating Random Simple Polygon
- Generating equilateral random polygons in confinement. II
- Random Triangles and Polygons in the Plane
- A fast ergodic algorithm for generating ensembles of equilateral random polygons
- Few points to generate a random polytope
- Generating triangulations at random
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Generation of Random Triangular Digital Curves Using Combinatorial Techniques
- A randomized algorithm for triangulating a simple polygon in linear time
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
This page was built for publication: Randomly generating triangulations of a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716966)