Skip to main content

Programming Triangulations: The Triangulation Template Library (TTL)

  • Chapter
Triangulations and Applications

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 79.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics