./graphics/gts, GNU Triangulated Surface Library

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 0.7.6, Package name: gts-0.7.6, Maintainer: pkgsrc-users

GTS stands for the GNU Triangulated Surface Library. It provides a set of
useful functions to deal with 3D surfaces meshed with interconnected
triangles.

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.


Required to run:
[graphics/netpbm] [devel/glib2]

Required to build:
[pkgtools/cwrappers]

Master sites:

SHA1: 000720bebecf0b153eb28260bd30fbd979dcc040
RMD160: 2bfd4121412c16d63ee0aca65ccbc2601d6a7d51
Filesize: 926.608 KB

Version history: (Expand)


CVS history: (Expand)


   2017-05-22 10:59:12 by Adam Ciarcinski | Files touched by this commit (1)
Log message:
Removed USE_LANGUAGES comment
   2017-05-22 10:53:35 by Adam Ciarcinski | Files touched by this commit (1)
Log message:
Actually netpbm is not needed in buildlink3.mk
   2017-05-22 10:49:48 by Adam Ciarcinski | Files touched by this commit (5)
Log message:
GTS stands for the GNU Triangulated Surface Library. It provides a set of
useful functions to deal with 3D surfaces meshed with interconnected
triangles.

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.