CGAL Basic Library Manuals
Table of Contents

Title Page

Table of Contents

User Manual

1. Preface
2. Introduction
3. 2D Convex Hulls and Extreme Points
   • Introduction
   • Convex Hull
   • Example using Bykat's algorithm
   • Extreme Points and Hull Subsequences
   • Traits Classes
   • Convexity Checking
4. 3D Convex Hulls
   • Introduction
   • Static Convex Hull Construction
   • Example of Incremental Construction
   • Example of Dynamic Construction
5. dD Convex Hulls and Delaunay Triangulations
   • Introduction
   • dD Convex Hull
   • Delaunay Triangulation
6. Polygons and Polygon Operations
   • Introduction
   • Example
7. Planar Nef Polyhedra
   • Introduction
   • Construction and Composition
   • Exploration
   • Traits Classes
   • Implementation
8. Planar Polygon Partitioning
   • Introduction
   • Monotone Partitioning
   • Convex Partitioning
9. 2D Planar Maps
   • Introduction
   • Terms and Software Design
   • Example Programs
10. 2D Planar Maps of Intersecting Curves
    • Introduction
    • Simple Example of a Segment Planar Map with Intersections
11. 2D Arrangements
    • Introduction
    • Software Design
    • Segment Arrangements
    • Arrangements with Circular Arcs
    • Polyline Arrangements
    • User-defined Hierarchy
12. Topological Maps
    • Introduction
    • Basic Terms and Software Design
    • Example Programs
13. 3D Polyhedral Surfaces
    • Release Note
    • Introduction
    • Definition
    • Example Programs
    • File I/O
    • Extending Vertices, Halfedges, and Facets
    • Advanced Example Programs
14. Halfedge Data Structures
    • Release Note
    • Introduction
    • Software Design
    • Example Programs
15. 2D Triangulations
    • Definitions
    • Software Design
    • Basic Triangulations
    • Delaunay Triangulations
    • Regular triangulations
    • Constrained Triangulations
    • Constrained Delaunay Triangulations
    • The Triangulation Hierarchy
16. 2D Triangulation Data Structure
    • The Concept
    • Models of Triangulation Data Structure
    • The Base Vertex and Face Classes
    • Example : Using one's own Base Face
17. 3D Triangulation
    • Representation
    • Software Design
    • Basic Triangulation
    • Delaunay Triangulation
    • Triangulation hierarchy
    • Regular Triangulation
    • Examples
18. 3D Triangulation Data Structure
    • Representation
    • Software Design
    • Example of incremental construction
19. 2D Alpha Shapes
    • Definitions
    • Functionality
    • Concepts and Models
    • Examples
20. 3D Alpha Shapes
    • Definitions
    • Functionality
    • Concepts and Models
    • Examples
21. Geometric Optimisation
22. 2D Search Structures
    • Introduction
    • Examples
23. dD Search Structures
    • Introduction
    • Definitions
    • Software Design for Range and Segment Trees
    • Creating an arbitrary multilayer tree
    • Range Trees
    • Segment Trees
    • Kd-Trees

Reference Manual

1. Introduction
   • Namespace CGAL
   • Inclusion Order of Header files
   • Preconditions, Postconditions, Assertions and Warnings
   • Altering the failure behaviour
   • Customising how errors are reported
2. 2D Convex Hulls and Extreme Points
3. 3D Convex Hulls
4. dD Convex Hulls and Delaunay Triangulations
5. Polygons and Polygon Operations
6. Planar Nef Polyhedra
7. Planar Polygon Partitioning
8. 2D Planar Maps
9. 2D Planar Maps of Intersecting Curves
10. 2D Arrangements
11. Topological Maps
12. 3D Polyhedral Surfaces
13. Halfedge Data Structure
14. 2D Triangulations
15. 2D Triangulation Data Structure
16. 3D Triangulations
17. 3D Triangulation Data Structures
18. 2D Alpha Shapes
19. 3D Alpha Shapes
20. Geometric Optimisation
21. 2D Search Structures
22. dD Search Structures

Bibliography

Index