Programming triangulations: The triangulation template library (TTL)

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.