Convexity minimizes pseudo-triangulations (Q598549): Difference between revisions

Pseudo-triangulations have received considerable attention in computational geometry due to their applications [e.g. \textit{B. Speckmann} and \textit{C. D. Tóth}, Proc. 14th Symp. Disc. Alg. 109--118 (2003; Zbl 1094.68680) and \textit{D. Kirkpatrick, J. Snoeyink} and \textit{B. Speckmann}, Internat. J. Comput. Geom. Appl. 12, 3--27 (2002; Zbl 1152.68671)] and interesting geometric and combinatorial properties [e.g. \textit{O. Aichholzer, F. Aurenhammer; H. Krasser} and \textit{P. Brass}, SIAM J. Comput. 32, No. 6, 1621--1653 (2003; Zbl 1041.68105)]. The authors show here that sets of points in convex position minimize the number of minimum pseudo-triangulations.