Title: Computational%20Geometry%20Algorithms%20Library
1Computational Geometry Algorithms Library
CGAL
Source CGAL web page http//www.cgal.org
2Source CGAL web page
3 as of 2004
Source CGAL web page
4Source CGAL web page
52D Convex Hull
Source CGAL web page
62D Polygon Partitioning
Partitions polygons into convex pieces.
Source CGAL web page
7Delaunay Triangulations
Source CGAL web page
82D Boolean Operations
A Nef-polyhedron in dimension d is a point set
generated from a finite number of open
halfspaces by set complement and set intersection
operations. Nef78
Source CGAL web page
92D Arrangements
Source CGAL web page
10Spatial Searching
Source CGAL web page
11Geometric Optimization
Finds either maximum area or maximum perimeter
convex k-gon whose vertices are vertices of
convex hull of point set.
Source CGAL web page
12Geometric Optimization (continued)
Source CGAL web page
13Geometric Optimization (continued)
Source CGAL web page
14Robustness
Source CGAL web page
15CGAL Basics
- C
- Can work with LEDA
- 3 Main Parts
- Kernel
- Geometric primitive objects operations on them
- Unmodifiable
- Dual object representation
- Stand-alone classes parameterized by
representation class - Members of kernel class
- Basic data structures algorithms
- Parameterized by traits classes
- Define interface with primitives
- Non-geometric support facilities
Source CGAL web page
16Source CGAL web page
17Source CGAL web page
18Source CGAL web page
19Source CGAL web page
20Source CGAL web page
21Source CGAL web page
22Source CGAL web page
23Programming Details
- Preface CGAL names with CGAL
- include CGAL/basic.h first in program
- Or another CGAL header file that includes it
Source CGAL web page
24Programming Example
Source CGAL web page
25Simple Nongraphical CGAL Example
26Simple Nongraphical CGAL Example