Skip to content

Commit

Permalink
Merge pull request #283 from v4hn/CGAL
Browse files Browse the repository at this point in the history
CGAL: resurrected and version bump
  • Loading branch information
Stefan Wold committed Feb 24, 2014
2 parents faf8487 + 65c1f58 commit 63a6b74
Show file tree
Hide file tree
Showing 3 changed files with 40 additions and 0 deletions.
4 changes: 4 additions & 0 deletions libs/CGAL/BUILD
@@ -0,0 +1,4 @@
# The first one I have found that is case sensitive to "RELEASE"
OPTS+=" -DBUILD_SHARED_LIBS=TRUE -DCMAKE_BUILD_TYPE=Release" &&

default_cmake_build
7 changes: 7 additions & 0 deletions libs/CGAL/DEPENDS
@@ -0,0 +1,7 @@
depends gmp
depends boost
depends mpfr
depends lapack
depends qt4

optional_depends zlib "" "" "for file compression support"
29 changes: 29 additions & 0 deletions libs/CGAL/DETAILS
@@ -0,0 +1,29 @@
MODULE=CGAL
VERSION=4.3
SOURCE=$MODULE-$VERSION.tar.xz
SOURCE_URL=https://gforge.inria.fr/frs/download.php/32995
SOURCE_VFY=sha1:aa88acd3c3fa67e798f631bc9e1c65f111fb8659
WEB_SITE=http://www.cgal.org/
ENTERED=20110112
UPDATED=20130223
LICENSE="lgpl"
SHORT="Computational Geometry Algorithms Library"

cat << EOF
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.
EOF

0 comments on commit 63a6b74

Please sign in to comment.