The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

CGAL: The Computational Geometry Algorithms Library

Author's notes:

The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), Boolean operations on polygons and polyhedra, arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Delaunay mesh generation and 3D surface mesh generation, skin surfaces), geometry processing (surface mesh simplification, subdivision and parameterization, as well as estimation of local differential properties, and approximation of ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), operations on polygons (straight skeleton and offset polygon), search structures (kd trees for nearest neighbor search, and range and segment trees), interpolation (natural neighbor interpolation and placement of streamlines), shape analysis, fitting, and distances (smallest enclosing sphere of points or spheres, smallest enclosing ellipsoid of points, principal component analysis), and kinetic data structures.

  • Download Files (local site)
  • Offical Site

    Problem Links

    Convex Hull (10)
    Robust Geometric Primitives (10)
    Minkowski Sum (10)
    Maintaining Line Arrangements (8)
    Point Location (8)
    Range Search (8)
    Medial-Axis Transformation (8)
    Intersection Detection (7)
    Motion Planning (7)
    Polygon Partitioning (7)
    Simplifying Polygons (7)
    Voronoi Diagrams (6)
    Kd-Trees (5)
    Triangulation (5)
    Voronoi Diagrams (5)

    This page last modified on 2008-07-10 .