Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Isomorph-free exhaustive generation
Journal of Algorithms
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
Journal of Combinatorial Theory Series B
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming
International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
VISI Physical Design Automation: Theory and Practice
VISI Physical Design Automation: Theory and Practice
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
Optimal Coding and Sampling of Triangulations
Algorithmica
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G , called the "tree of triangulations," and generates each triangulation of G in O (1) time. The algorithm uses O (n ) space and generates all triangulations of G without duplications. To the best of our knowledge, our algorithm is the first algorithm for generating all triangulations of a triconnected plane graph; although there exist algorithms for generating triangulated graphs with certain properties. Our algorithm for generating all triangulations of a triconnected plane graph needs to find all triangulations of a convex polygon. We give an algorithm to generate all triangulations of a convex polygon P of n vertices in time O (1) per triangulation, where the vertices of P are numbered. Our algorithm for generating all triangulations of a convex polygon also improves previous results; existing algorithms need to generate all triangulations of convex polygons of less than n vertices before generating the triangulations of a convex polygon of n vertices. Finally, we give an algorithm for generating all triangulations of a convex polygon P of n vertices in time O (n 2) per triangulation, where vertices of P are not numbered.