1 Triangles and Triangulations 1.1 Triangles 1.2 Triangulations 1.3 Some properties of triangulations 1.4 A Triangulation Algorithm 1.5 Edge Insertion 1.6 Using Triangulations 1.7 Exercises 2 Graphs and Data Structures 2.1 Graph Theoretic Concepts 2.2 Generalized Maps (G-maps) 2.3 Data Structures for Triangulations 2.4 A Minimal Triangle-Based Data Structure 2.5 Triangle-Based Data Structure with neighbors 2.6 Vertex-Based Data Structure with neighbors 2.7 Half-Edge Data Structure 2.8 Dart-Based Data Structure 2.9 Triangles for visualization 2.10 Binary Triangulations 2.11 Exercises 3 Delaunay Triangulations and Voronoi Diagrams 3.1 Optimal Triangulations 3.2 The Neutral Case 3.3 Voronoi diagrams 3.4 Delaunay Triangulation as the Dual of the Voronoi Diagram 3.5 The Circle Criterion 3.6 Equivalence of the Delaunay Criteria for Strictly Convex Quadrilaterals 3.7 Computing the Circumcircle Test 3.8 The Local Optimization Procedure (LOP) 3.9 Global Properties of the Delaunay Triangulation 3.10 Exercises 4 Algorithms for Delaunay Triangulation 4.1 A Simple Algorithm Based on Previous Results 4.2 Radial Sweep 4.3 A Step-by-Step Approach for Making Delaunay Triangles 4.4 Incremental Algorithms 4.5 Inserting a Point into a Delaunay Triangulation 4.6 Point Insertion and Edge-Swapping 4.7 Running Time of Incremental Algorithms 4.8 Divide-and-Conquer 4.9 Exercises 5 Data Dependent Triangulations 5.1 Motivation 5.2 Optimal Triangulations Revisited 5.3 The General Concept 5.4 Data Dependent Swapping Criteria 5.5 On Implementation of the LOP 5.6 Modified Local Optimization Procedures (MLOP) 5.7 Simulated Annealing 5.8 Exercises 6 Constrained Delaunay Triangulation 6.1 Delaunay Triangulation of a Planar Straight-Line Graph 6.2 Generalization of Delaunay Triangulation 6.3 Algorithms for Constrained Delaunay Triangulation 6.4 Inserting an Edge into a CDT 6.5 Edge Insertion and Swapping 6.6 Inserting a Point into a CDT 6.7 Exercises 7 Delaunay Refinement Mesh Generation 7.1 Introduction 7.2 General Requirements for Meshes 7.3 Node Insertion 7.4 Splitting Encroached Segments 7.5 The Delaunay Refinement Algorithm 7.6 Minimum Edge Length and Termination 7.7 Corner-Lopping for Handling Small Input Angles 7.8 Spatial Grading 7.9 Exercises 8 Least Squares Approximation of Scattered Data 8.1 Another Formulation of Surface Triangulations 8.2 Approximation over Triangulations of Subsets of Data 8.3 Existence and Uniqueness 8.4 Sparsity and Symmetry 8.5 Penalized Least Squares 8.6 Smoothing Terms for Penalized Least Squares 8.7 Approximation over General Triangulations 8.8 Weighted Least Squares 8.9 Constrained Least Squares 8.10 Approximation over Binary Triangulations 8.11 Numerical Examples for Binary Triangulations 8.12 Exercises 9 Programming Triangulations: The Triangulation Template Library (TTL) 9.1 Implementation of the Half-Edge Data Structure 9.2 The Overall Design and the Adaptation Layer 9.3 Topological Queries and the Dart Class 9.4 Some Iterator Classes 9.5 Geometric Queries and the Traits Class 9.6 Geometric and Topological Modifiers 9.7 Generic Delaunay Triangulation 9.8 Exercises References Index

This book will serve as a valuable source of information about triangulations for the graduate student and researcher. With emphasis on computational issues, it presents the basic theory necessary to construct and manipulate triangulations. In particular, the book gives a tour through the theory behind the Delaunay triangulation, including algorithms and software issues. It also discusses various data structures used for the representation of triangulations.