# The math/cgal port

## cgal-4.1 – Computational Geometry Algorithms Library

## Description

    The Computational Geometry Algorithms Library (CGAL) offers data
    structures and algorithms like triangulations (2D constrained
    triangulations and Delaunay triangulations in 2D and 3D, periodic
    triangulations in 3D), Voronoi diagrams (for 2D and 3D points, 2D
    additively weighted Voronoi diagrams, and segment Voronoi diagrams),
    polygons (Boolean operations, offsets, straight skeleton), polyhedra
    (Boolean operations), arrangements of curves and their applications
    (2D and 3D envelopes, Minkowski sums), mesh generation (2D Delaunay
    mesh generation and 3D surface and volume 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), 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.

WWW: http://www.cgal.org/

Not for arches
  vax
Broken
  on mips64: ICE on Interval_nt.h:98
Categories:
  math

## Library dependencies

- devel/boost
- devel/gmp
- devel/mpfr
- x11/qt4

## Build dependencies

- STEM->=2.8.11.1p0:devel/cmake
- devel/ninja

## Run dependencies