Abstract
Let P be a set of points in the plane and assume that P is in general position. A triangulation of P is a maximal non-crossing geometric graph with vertex set P. All bounded faces of a triangulation are triangles (that’s why we call them triangulation), the unbounded face is the outside of the convex hull of P. Triangulations play a prominent role in many applicable and applied disciplines like computational geometry, computer graphics and numerical modeling. In this chapter we discuss combinatorial and geometrical properties of triangulations and of the flip-graph on the set of all triangulations of a point set P.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Friedr. Vieweg & Sohn Verlag/GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
Felsner, S. (2004). Triangulations and Flips. In: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80303-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-322-80303-0_7
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-06972-8
Online ISBN: 978-3-322-80303-0
eBook Packages: Springer Book Archive