<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN""http://www.w3.org/TR/html4/loose.dtd">
<HTML
><HEAD
><TITLE
>GTS Library Reference Manual</TITLE
><META
NAME="GENERATOR"
CONTENT="Modular DocBook HTML Stylesheet Version 1.79"><LINK
REL="NEXT"
TITLE="Basic Macros, functions and data structures"
HREF="c4.html"><STYLE
TYPE="text/css"
>.synopsis, .classsynopsis {
background: #eeeeee;
border: solid 1px #aaaaaa;
padding: 0.5em;
}
.programlisting {
background: #eeeeff;
border: solid 1px #aaaaff;
padding: 0.5em;
}
.variablelist {
padding: 4px;
margin-left: 3em;
}
.navigation {
background: #ffeeee;
border: solid 1px #ffaaaa;
margin-top: 0.5em;
margin-bottom: 0.5em;
}
.navigation a {
color: #770000;
}
.navigation a:visited {
color: #550000;
}
.navigation .title {
font-size: 200%;
}</STYLE
></HEAD
><BODY
CLASS="BOOK"
BGCOLOR="#FFFFFF"
TEXT="#000000"
LINK="#0000FF"
VLINK="#840084"
ALINK="#0000FF"
><DIV
CLASS="BOOK"
><DIV
CLASS="TITLEPAGE"
><TABLE
CLASS="navigation"
WIDTH="100%"
CELLPADDING="2"
CELLSPACING="0"
><TR
><TH
ALIGN="center"
VALIGN="MIDDLE"
><P
CLASS="TITLE"
>GTS Library Reference Manual<A
NAME="AEN2"></P
></TH
></TR
></TABLE
></DIV
><DIV
CLASS="TOC"
><DL
><DT
><B
>Table of Contents</B
></DT
><DT
><A
HREF="c4.html"
>Basic Macros, functions and data structures</A
></DT
><DD
><DL
><DT
><A
HREF="gts-binary-heaps.html"
>Binary heaps</A
> -- efficient data structure for priority heaps.</DT
><DT
><A
HREF="gts-extended-binary-heaps.html"
>Extended binary heaps</A
> -- efficient data structure for priority heaps allowing removal of elements.</DT
><DT
><A
HREF="gts-first-in-first-out-heaps.html"
>First In First Out heaps</A
> -- </DT
><DT
><A
HREF="gts-vectors-and-matrices.html"
>Vectors and matrices</A
> -- simple operations on vectors and matrices.</DT
><DT
><A
HREF="gts-simple-statistics.html"
>Simple statistics</A
> -- a basic structure for computing min, max, average and variance.</DT
><DT
><A
HREF="gts-miscellaneous-macros-and-functions.html"
>Miscellaneous macros and functions</A
> -- Various utilities.</DT
></DL
></DD
><DT
><A
HREF="c2915.html"
>Geometrical Object Hierarchy</A
></DT
><DD
><DL
><DT
><A
HREF="gts-object-class.html"
>Object class</A
> -- parent class for all GTS objects.</DT
><DT
><A
HREF="gts-container-classes.html"
>Container classes</A
> -- </DT
><DT
><A
HREF="gts-containee-classes.html"
>Containee classes</A
> -- </DT
><DT
><A
HREF="gts-points.html"
>Points</A
> -- point object and related functions.</DT
><DT
><A
HREF="gts-vertices.html"
>Vertices</A
> -- vertex object and related functions.</DT
><DT
><A
HREF="gts-segments.html"
>Segments</A
> -- segment object and related functions.</DT
><DT
><A
HREF="gts-edges.html"
>Edges</A
> -- edge object and related functions.</DT
><DT
><A
HREF="gts-triangles.html"
>Triangles</A
> -- triangle object and related functions.</DT
><DT
><A
HREF="gts-faces.html"
>Faces</A
> -- face object and related functions.</DT
><DT
><A
HREF="gts-surfaces.html"
>Surfaces</A
> -- surface object and related functions.</DT
></DL
></DD
><DT
><A
HREF="c10545.html"
>Geometrical data structures</A
></DT
><DD
><DL
><DT
><A
HREF="gts-kd-trees.html"
>Kd-Trees</A
> -- an efficient way of doing point location queries.</DT
><DT
><A
HREF="gts-bounding-boxes-trees.html"
>Bounding boxes trees</A
> -- implementation of axis-aligned bounding-box trees.</DT
></DL
></DD
><DT
><A
HREF="c12206.html"
>Surface operations</A
></DT
><DD
><DL
><DT
><A
HREF="gts-boolean-operations.html"
>Boolean operations</A
> -- set operations between surfaces: union, intersection, difference.</DT
><DT
><A
HREF="gts-surface-simplification-and-refinement.html"
>Surface simplification and refinement</A
> -- reducing or increasing the number of edges of a triangulated surface.</DT
><DT
><A
HREF="gts-out-of-core-simplification.html"
>Out-of-core simplification</A
> -- objects for simplification based on vertex clustering.</DT
><DT
><A
HREF="gts-isosurfaces-from-3d-functions.html"
>Isosurfaces from 3D functions</A
> -- computing triangulated isosurfaces of a given function f(x,y,z).</DT
><DT
><A
HREF="gts-delaunay-and-constrained-delaunay-triangulations.html"
>Delaunay and constrained Delaunay triangulations</A
> -- implementation of a dynamic Delaunay triangulation algorithm.</DT
><DT
><A
HREF="gts-differential-geometry-operators.html"
>Differential geometry operators</A
> -- </DT
></DL
></DD
><DT
><A
HREF="c15264.html"
>Progressive and Hierarchical surfaces</A
></DT
><DD
><DL
><DT
><A
HREF="gts-vertex-split.html"
>Vertex split</A
> -- object encoding a reversible edge-collapse operation.</DT
><DT
><A
HREF="gts-progressive-surfaces.html"
>Progressive surfaces</A
> -- continuous level-of-detail for surfaces.</DT
><DT
><A
HREF="gts-hierarchical-vertex-split.html"
>Hierarchical vertex split</A
> -- hierarchical extension of the vertex split.</DT
><DT
><A
HREF="gts-hierarchical-surfaces.html"
>Hierarchical surfaces</A
> -- extension of progressive surfaces allowing arbitrary sequences of vertex split or collapse.</DT
></DL
></DD
><DT
><A
HREF="c17114.html"
>Graph and operations on graphs</A
></DT
><DD
><DL
><DT
><A
HREF="gts-graph-class.html"
>Graph class</A
> -- </DT
><DT
><A
HREF="gts-weighted-graph.html"
>Weighted graph</A
> -- </DT
><DT
><A
HREF="gts-progressive-graph.html"
>Progressive graph</A
> -- </DT
><DT
><A
HREF="gts-graph-partitioning.html"
>Graph partitioning</A
> -- </DT
></DL
></DD
></DL
></DIV
></DIV
><TABLE
CLASS="navigation"
WIDTH="100%"
SUMMARY="Navigation footer"
CELLPADDING="2"
CELLSPACING="2"
><TR
VALIGN="middle"
><TD
ALIGN="left"
></TD
><TD
ALIGN="right"
><A
ACCESSKEY="n"
HREF="c4.html"
><B
>Basic Macros, functions and data structures >>></B
></A
></TD
></TR
></TABLE
></BODY
></HTML
>
