Abstract
In this paper, we present 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. The current best algorithm takes O(n 4) time. We also derive algorithms for computing the expected degree of each vertex, the expected number of ears, the expected number of interior triangles, and the expected height of the corresponding tree in such a triangulated polygon. These results are not known for simple polygon. All these algorithms are dominated by the \(O(n^2 + |E|^{\frac{3}{2}})\) time triangulation counting algorithm. If the results of the triangulation counting algorithm are given, then the triangulation generating algorithm takes O(n log n) time only. All these algorithms are simple and easy to be implemented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atkinson, M., Sack, J.: ‘Generating Binary Trees at Random’. Information Processing Letters 41, 21–23 (1992)
Devroye, L.: ‘A Note on the Height of Binary Search Trees’. Journal on ACM 33, 489–498 (1986)
Devroye, L., Flajolet, P., Hurtado, F., Noy, M., Steiger, W.: Random Triangulations. Discrete and Computational Geometry 22, 105–117 (1999)
Epstein, P., Sack, J.: Generating triangulation at Random. ACM Trans. On Modeling and Computer Simulation 4(3), 267–278 (1994)
Epstein, P.: Generating geometric objects at random’, Master’s thesis, School of Computer Science, Carleton university, Canada (1992)
Bern, M., Eppstein, D.: Mesh Generation And Optimal Triangulation. In: Du, D.-Z., Hwang, F. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol. 1, World Scientific, Singapore
Welzl, E.: Constructing the visibility graph for n line segments in O(n2) time. Information Processing Letters 20, 167–171 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, Q., Qian, J., Tsang, W., Wang, C. (2005). Randomly Generating Triangulations of a Simple Polygon. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_48
Download citation
DOI: https://doi.org/10.1007/11533719_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)