aboutsummaryrefslogtreecommitdiffstats
path: root/graphics/gts/pkg-descr
diff options
context:
space:
mode:
authorijliao <ijliao@FreeBSD.org>2002-06-23 23:56:09 +0800
committerijliao <ijliao@FreeBSD.org>2002-06-23 23:56:09 +0800
commit1b9d4a45399ca4a3051ab0337b7cc9953d8d21a0 (patch)
treeaf87062b80f4363f4bf15914018d317f65afcb3c /graphics/gts/pkg-descr
parente0f96d6bf6356a80a24f10cf36dc21e75060993b (diff)
downloadfreebsd-ports-gnome-1b9d4a45399ca4a3051ab0337b7cc9953d8d21a0.tar.gz
freebsd-ports-gnome-1b9d4a45399ca4a3051ab0337b7cc9953d8d21a0.tar.zst
freebsd-ports-gnome-1b9d4a45399ca4a3051ab0337b7cc9953d8d21a0.zip
add gts 0.6.0
GNU Triangulated Surface Library
Diffstat (limited to 'graphics/gts/pkg-descr')
-rw-r--r--graphics/gts/pkg-descr26
1 files changed, 26 insertions, 0 deletions
diff --git a/graphics/gts/pkg-descr b/graphics/gts/pkg-descr
new file mode 100644
index 000000000000..38bd43fddd2e
--- /dev/null
+++ b/graphics/gts/pkg-descr
@@ -0,0 +1,26 @@
+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 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.
+ - 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.
+
+WWW: http://gts.sourceforge.net/