Abstract
Triangulations can be dealt with algebraically using the principles of G-maps introduced in Chapter 2. High-level abstraction of functions operating on triangulations is achieved using G-maps, which are algebraically defined based on a limited number of clear concepts. At an abstract level, the topology of a triangulation can be described by using only one single topological element, the dart. Furthermore, the three α-iterators, α0, α1 and α2, are the only operations needed for traversing the triangulation.
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.
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). Programming Triangulations: The Triangulation Template Library (TTL). In: Triangulations and Applications. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33261-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-33261-8_9
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)