CGAL 3.8 port; needs recent libm (i.e., fenv.h) to build

math/cgal/Makefile

@@ -0,0 +1,47 @@
+# $OpenBSD: Makefile,v 1.1.1.1 2011/04/29 17:47:50 matthew Exp $
+
+# vax:	no fenv.h support
+NOT_FOR_ARCHS =		vax
+
+COMMENT =		Computational Geometry Algorithms Library
+
+V =			3.8
+PKGNAME =		cgal-${V}
+DISTNAME =		CGAL-${V}
+
+SHARED_ONLY =		Yes
+SHARED_LIBS =		CGAL		0.0 \
+			CGAL_Core	0.0 \
+			CGAL_ImageIO	0.0 \
+			CGAL_Qt4	0.0 
+
+CATEGORIES =		math
+
+HOMEPAGE =		http://www.cgal.org/
+
+# mix of LGPLv2.1 and QPL; see http://www.cgal.org/license.html
+PERMIT_PACKAGE_CDROM =	Yes
+PERMIT_PACKAGE_FTP =	Yes
+PERMIT_DISTFILES_CDROM =Yes
+PERMIT_DISTFILES_FTP =	Yes
+
+WANTLIB =		GL GLU ICE SM X11 Xext boost_thread-mt gmp gmpxx \
+			lib/qt4/QtGui lib/qt4/QtOpenGL m mpfr stdc++ z
+
+# Awkward hosting site; see https://gforge.inria.fr/frs/?group_id=52 for files index.
+MASTER_SITES =		https://gforge.inria.fr/frs/download.php/28500/
+
+MODULES =		devel/cmake \
+			x11/qt4
+LIB_DEPENDS =		devel/boost \
+			devel/gmp \
+			devel/mpfr
+
+CONFIGURE_ENV =         CFLAGS="${CFLAGS} -I${X11BASE}/include" \
+                        CXXFLAGS="${CXXFLAGS} -I${X11BASE}/include" \
+                        LDFLAGS="${LDFLAGS} -L${X11BASE}/lib"
+
+post-patch:
+	rm ${WRKSRC}/scripts/cgal_make_macosx_app
+
+.include <bsd.port.mk>

math/cgal/distinfo

@@ -0,0 +1,5 @@
+MD5 (CGAL-3.8.tar.gz) = uKeeYuTYuotknYFa670cCg==
+RMD160 (CGAL-3.8.tar.gz) = Xl4TI65FPZKOhbT2p2R/nW0pc9A=
+SHA1 (CGAL-3.8.tar.gz) = I3SN8eYNYtoWbS45VzKuL+J0MX0=
+SHA256 (CGAL-3.8.tar.gz) = se3VGIYTTPCG0XmCxQ9xAleBFWHSiLQ5rzprxjI4ntQ=
+SIZE (CGAL-3.8.tar.gz) = 14112547

math/cgal/pkg/DESCR

@@ -0,0 +1,19 @@
+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.