# Generating triangulations at random

@article{Epstein1994GeneratingTA,
title={Generating triangulations at random},
author={Peter Epstein and J{\"o}rg-R{\"u}diger Sack},
journal={ACM Trans. Model. Comput. Simul.},
year={1994},
volume={4},
pages={267-278}
}
• Published 1 July 1994
• Computer Science, Mathematics
• ACM Trans. Model. Comput. Simul.
An <italic>O(n<supscrpt>3</supscrpt>)</italic> algorithm is described to count triangulations of a simple polygon with <italic>n</italic>vertices. This algorithm is used to construct an <italic>O(n<supscrpt>4</supscrpt>)</italic> algorithm to generate triangulations of a simple polygon at random with a uniform probability distribution. The problem of counting triangulations of a simple polygon is then related to existing problems in graph theory.
Randomly Generating Triangulations of a Simple Polygon
• Computer Science
COCOON
• 2005
An O(n^2 + |E|^{\frac{3}{2}}) time algorithm for generating triangulations of a simple polygon at random with uniform distribution, where n and |E | are the number of vertices and diagonal edges in the given polygon, respectively.
Generating Random Polygons with Given Vertices
• Mathematics, Computer Science
Comput. Geom.
• 1996
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
• Computer Science, Mathematics
STACS
• 2003
We propose a new linear time algorithm to represent a planar graph. Based on a specific triangulation of the graph, our coding takes on average 5.03 bits per node, and 3.37 bits per node if the graph
Random Polygon Generation through Convex Layers
• Computer Science, Mathematics
• 2013
On typical triangulations of a convex $n$-gon
• Mathematics
Journal of Combinatorics
• 2021
Let $f_n$ be a function assigning weight to each possible triangle whose vertices are chosen from vertices of a convex polygon $P_n$ of $n$ sides. Suppose ${\mathcal T}_n$ is a random triangulation,
Random polygon generation using ‘GRP_AS’ heuristic