Abstract
The topology of a triangulation can be described by graph theoretic concepts such that a clear distinction is made between the topological structure and the geometric embedding information. The topological elements of a triangulation are nodes (or vertices), edges and triangles, and the geometric embedding information, which is associated with these elements, is points, curves (or straight-line segments) and surface patches respectively. Likewise, a distinction can be made between topological and geometric operators. By considering triangulations as planar graphs, we can benefit from an extensive theory and a variety of interesting algorithms operating on graphs. In particular, we will see that generalized maps, or G-maps, provide useful algebraic tools to consider triangulations at an abstract level. Common data structures for representing triangulations on computers are outlined and compared in view of storage requirements and efficiency of carrying out topological operations.
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). Graphs and Data Structures. In: Triangulations and Applications. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33261-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-33261-8_2
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)