# 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.

## Figures from this paper

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
2013 Sixth International Conference on Contemporary Computing (IC3)
• 2013
The proposed heuristic, “GRP_AS” is based on the principle of random selection of a line segment and angular sorting of the point set and takes O(nlogn) time which is less than that of “2-Opt Move” heuristic as well as ‘grP_CH’ heuristic.
Use of simple polygonal chains in generating random simple polygons
• Computer Science
• 2017
The experimental results show that the third algorithm produces more polygons rather than the well-known 2-opt move algorithm and the first algorithm acts better than the second algorithm, where both act better than steady Growth.
Exact uniform sampling over catalan structures
• Computer Science, Mathematics
ArXiv
• 2018
We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths

## References

SHOWING 1-10 OF 19 REFERENCES
An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon
• Computer Science
SIAM J. Comput.
• 1988
Improved algorithms for several other computational geometry problems, including testing whether a polygon is simple, follow from the proposed O(n\log \log n)-time algorithm, improving on the previously best bound and showing that triangulation is not as hard as sorting.
Optimal shortest path queries in a simple polygon
• Mathematics, Computer Science
SCG '87
• 1987
This paper shows how to preprocess the polygon so that, given two query points, the length of the shortest path inside thePolygon can be found in time in time proportional to the number of turns it makes.
Linear time algorithms for visibility and shortest path problems inside simple polygons
• Mathematics
SCG '86
• 1986
We present linear time algorithms for solving the following problems involving a simple planar polygon <italic>P</italic>: (i) Computing the collection of all shortest paths inside <italic>P</italic>
Visibility of a simple polygon
• D. T. Lee
• Computer Science
Comput. Vis. Graph. Image Process.
• 1983
Computational geometry: an introduction
• Physics
• 1985
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Generating Binary Trees at Random
• Computer Science, Mathematics
Inf. Process. Lett.
• 1992
POLYGONS HAVE EARS
Triangulating Simple Polygons and Equivalent Problems
• Computer Science
TOGS
• 1984
A number of problems, such as the decomposition of simple polygons into convex, star, monotone, spiral, and trapezoidal polygons and the determination of edgevertex visibility, are linearly equivalent to the triangulation problem and therefore share the same lower bound.
Intersection graphs of some families of plane curves
• Ph.D. thesis,
• 1983