1. Computational Geometry Algorithms Library Source: CGAL web page http://www.cgal.org

2. Source: CGAL web page

3. * as of 2004

4. Source: CGAL web page

5. 2D Convex Hull Source: CGAL web page

6. 2D Polygon Partitioning Source: CGAL web page Partitions polygons into convex pieces.

7. Delaunay Triangulations Source: CGAL web page

8. 2D Boolean Operations Source: CGAL web page “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]

9. 2D Arrangements Source: CGAL web page

10. Spatial Searching Source: CGAL web page

11. Geometric Optimization Source: CGAL web page Finds either maximum area or maximum perimeter convex k- gon whose vertices are vertices of convex hull of point set.

12. Geometric Optimization (continued) Source: CGAL web page

13. Geometric Optimization (continued) Source: CGAL web page

14. Robustness Source: CGAL web page

15. CGAL 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

23. Programming 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

24. Programming Example Source: CGAL web page

25. Simple Nongraphical CGAL Example