Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

Merge pull request #283 from v4hn/CGAL

CGAL: resurrected and version bump
  • Loading branch information...
commit 63a6b74351db012a9b15c4ce0155f40c3b38475b 2 parents faf8487 + 65c1f58
@Ratler Ratler authored
Showing with 40 additions and 0 deletions.
  1. +4 −0 libs/CGAL/BUILD
  2. +7 −0 libs/CGAL/DEPENDS
  3. +29 −0 libs/CGAL/DETAILS
View
4 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
View
7 libs/CGAL/DEPENDS
@@ -0,0 +1,7 @@
+depends gmp
+depends boost
+depends mpfr
+depends lapack
+depends qt4
+
+optional_depends zlib "" "" "for file compression support"
View
29 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
Please sign in to comment.
Something went wrong with that request. Please try again.