[Lunar-commits] <moonbase> gts: initial import.

[Dennis 'stumbles' Veatch]

commit 0649dbf0ebe2f65b0174e289a31358337ccce0bd
Author: Dennis 'stumbles' Veatch <stumbles at lunar-linux.org>
Date:   Thu Feb 26 20:20:18 2009 -0500

    gts: initial import.
---
 libs/gts/DEPENDS |    1 +
 libs/gts/DETAILS |   38 ++++++++++++++++++++++++++++++++++++++
 2 files changed, 39 insertions(+), 0 deletions(-)

diff --git a/libs/gts/DEPENDS b/libs/gts/DEPENDS
new file mode 100644
index 0000000..2ce0fd3
--- /dev/null
+++ b/libs/gts/DEPENDS
@@ -0,0 +1 @@
+depends  netpbm
diff --git a/libs/gts/DETAILS b/libs/gts/DETAILS
new file mode 100644
index 0000000..eaafd35
--- /dev/null
+++ b/libs/gts/DETAILS
@@ -0,0 +1,38 @@
+          MODULE=gts                                                                                                                           
+         VERSION=0.7.6                                                                                                                         
+          SOURCE=$MODULE-$VERSION.tar.gz                                                                                                       
+      SOURCE_URL=$SFORGE_URL/$MODULE                                                                                                           
+      SOURCE_VFY=sha1:000720bebecf0b153eb28260bd30fbd979dcc040
+        WEB_SITE=http://gts.sourceforge.net/
+         ENTERED=20090226
+         UPDATED=20090225
+           SHORT="GNU Triangulated Surface Library"
+cat << EOF
+GTS stands for the GNU Triangulated Surface Library. It is an Open Source Free
+Software Library intended to provide a set of useful functions to deal with 3D
+surfaces meshed with interconnected triangles. The source code is available
+free of charge under the Free Software LGPL license.
+
+The code is written entirely in C with an object-oriented approach based mostly
+on the design of GTK+. Careful attention is paid to performance related issues
+as the initial goal of GTS is to provide a simple and efficient library to
+scientists dealing with 3D computational surface meshes.
+
+A brief summary of its main features:
+
+    * Simple object-oriented structure giving easy access to topological
+      properties.
+    * 2D dynamic Delaunay and constrained Delaunay triangulations.
+    * Robust geometric predicates (orientation, in circle) using fast adaptive
+      floating point arithmetic (adapted from the fine work of Jonathan R.
+      Shewchuk).
+    * Robust set operations on surfaces (union, intersection, difference).
+    * Surface refinement and coarsening (multiresolution models).
+    * Dynamic view-independent continuous level-of-detail.
+    * Preliminary support for view-dependent level-of-detail.
+    * Bounding-boxes trees and Kd-trees for efficient point location and
+      collision/intersection detection.
+    * Graph operations: traversal, graph partitioning.
+    * Metric operations (area, volume, curvature ...).
+    * Triangle strips generation for fast rendering.
+EOF