computational geometry algorithms library source: cgal web page

Computational Geometry Algorithms Library

Source: CGAL web page http://www.cgal.org

Source: CGAL web page


* as of 2004

2D Convex Hull


2D Polygon Partitioning


Partitions polygons into convex pieces.

Delaunay Triangulations


2D 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]

dP

2D Arrangements


Spatial Searching


Geometric Optimization


Finds either maximum area or maximum perimeter convex k-gon whose vertices are vertices of convex hull of point set.

Geometric Optimization (continued)


Robustness


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


Programming Details

• Preface CGAL names with CGAL::

• #include CGAL/basic.h first in program– Or another CGAL header file that includes it


Programming Example


Simple Nongraphical CGAL Example

computational geometry algorithms library source: cgal web page

Documents

cgal web page slide

cgal web page http

nef78 slide

robustness source

geometric optimization

cgal basics c

cgal header file

d arrangements source