• Randomly generating triangulat...

Result: Randomly generating triangulations of a simple polygon

Title:
Randomly generating triangulations of a simple polygon
Authors:
DING, Q, QIAN, J, TSANG, W, WANG, C
Source:
COCOON 2005 : computing and combinatorics (Kunming, 16-29 August 2005)Lecture notes in computer science. :471-480
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 7 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Distribution aléatoire, Random distribution, Distribución aleatoria, Géométrie algorithmique, Computational geometry, Geometría computacional, Loi uniforme, Uniform distribution, Ley uniforme, Matrice diagonale, Diagonal matrix, Matriz diagonal, Oreille, Ear, Oido, Polygone, Polygon, Polígono, Problème combinatoire, Combinatorial problem, Problema combinatorio, Triangulation, Triangulación
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Zhejiang Radio & TV Transmission Center, HangZhou, China
Department of Computer Science, Memorial University of Newfoundland St. John's, Newfoundland, A1B 3X5, Canada
Department of Computer Science, The University of Hong Kong, Hong-Kong
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17096422
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.17096422
Database:
PASCAL Archive

Further Information

In this paper, we present an O(n2 + |E|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(n4) 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(n2 + |E|3 2) time triangulation counting algorithm. If the results of the triangulation counting algorithm are given, then the triangulation generating algorithm takes O(nlogn) time only. All these algorithms are simple and easy to be implemented.