Abstract
Although Delaunay triangulations have well-shaped triangles in the plane and satisfy an optimum principle by the MaxMin angle criterion, they are not necessarily optimal as domains for surfaces. In this chapter we are concerned with surfaces in 3D space defined over triangulations, and in particular surfaces represented by piecewise linear functions over triangulations in the plane. The main concern in this respect is to construct triangulations from 3D point sets where the triangulations are optimal according to local and global cost functions which are designed to reflect properties of the underlying physical model from which the points have been sampled.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Hjelle, Ø., Dæhlen, M. (2006). Data Dependent Triangulations. In: Triangulations and Applications. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33261-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-33261-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33260-2
Online ISBN: 978-3-540-33261-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)