Abstract
In this paper we give an algorithm to generate all biconnected plane triangulations having exactly n vertices including exactly r vertices on the outer face. The algorithm uses O(n) space in total and generates such triangulations without duplications in O(rn) time per triangulation, while the previous best algorithm generates such triangulations in O(r2n) time per triangulation. © Springer-Verlag 2004.
Cite
CITATION STYLE
Nakano, S. I., & Uno, T. (2004). More Efficient Generation of Plane Triangulations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 273–282. https://doi.org/10.1007/978-3-540-24595-7_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
