• 作者：Moria Ben-Ner^a ; ^{moriaben@tau.ac.il} ; André ; Schulz^b ; ^{andre.schulz@uni-muenster.de} ; Adam Sheffer^a ; ¹ ; ^{sheffera@tau.ac.il}
• 关键词：Pseudo-triangulation ; Triangulation ; Plane graph ; Graph counting
• 刊名：Computational Geometry
• 出版年：2013
• 出版时间：August, 2013
• 年：2013
• 卷：46
• 期：6
• 页码：688-699
• 全文大小：268 K

We derive the bounds and for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds and . We also prove that pointed pseudo-triangulations can be embedded over any specific set of N points in the plane, and at most general pseudo-triangulations.