Generating triangulations at random
From MaRDI portal
Publication:4876039
Recommendations
- Computing and Combinatorics
- Generating random points in a tetrahedron
- Random triangulations of the plane
- The generation of random equilateral polygons
- Random Triangles and Polygons in the Plane
- Generating random points in a polytope
- Generating random polygons with given vertices
- Random triangulations of planar points sets
- Random triangles in planar regions
Cited in
(16)- Random triangulations of the plane
- Properties of random triangulations and trees
- An efficient algorithm for enumeration of triangulations
- Generating random polygons with given vertices
- Counting polygon triangulations is hard
- Generation of random digital simple curves with artistic emulation
- Use of simple polygonal chains in generating random simple polygons
- Generating strictly binary trees at random based on convex polygon triangulations
- Generating equilateral random polygons in confinement. II
- Few points to generate a random polytope
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Generation of Random Triangular Digital Curves Using Combinatorial Techniques
- Computing and Combinatorics
- Computing diverse and nice triangulations
- Chains, Koch chains, and point sets with many triangulations
- Generating spherical Eulerian triangulations
This page was built for publication: Generating triangulations at random
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876039)
