Abstract
We present a bijection between the set of plane triangulations (aka maximal planar graphs) and a simple subset of the set of plane trees with two leaves adjacent to each node. The construction takes advantage of Schnyder tree decompositions of plane triangulations. This bijection yields an interpretation of the formula for the number of plane triangulations with n vertices. Moreover, the construction is simple enough to induce a linear random sampling algorithm, and an explicit information theory optimal encoding. Finally, we extend our bijection approach to triangulations of a polygon with k sides with m inner vertices, and develop in passing new results about Schnyder tree decompositions for these objects.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Poulalhon, D., Schaeffer, G. Optimal Coding and Sampling of Triangulations. Algorithmica 46, 505–527 (2006). https://doi.org/10.1007/s00453-006-0114-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0114-8