[Lunar-commits] <moonbase-other> gts: Readding to moonbase.

[Dennis Veatch]

commit a547dd1486aaab63de5b3d57164dcb473380b4c3
Author: Dennis Veatch <stumbles at lunar-linux.org>
Date: Thu, 12 Jul 2012 09:23:12 -0700
URL: https://github.com/lunar-linux/moonbase-other/commit/a547dd1486aaab63de5b3d57164dcb473380b4c3

gts: Readding to moonbase.
---
  libs/gts/DEPENDS                                             +1/-0     
  libs/gts/DETAILS                                             +38/-0    
  2 files changed, 39 insertions (+), 0 deletions (-)

--- /dev/null
+++ b/libs/gts/DEPENDS
@@ -0,0 +1 @@
+depends  netpbm
--- /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