vtf-logo

Computational Geometry Package Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
geom::Ball< N, T >A ball in N dimensional space
geom::BBox< N, T >An axes-oriented bounding box in the specified dimension
geom::BBoxTree< N, T >A bounding box tree in N-D
geom::BBoxTreeBranch< N, T >Class for an internal node in a BBoxTree
geom::BBoxTreeLeaf< N, T >Class for a leaf in a BBoxTree
geom::BBoxTreeNode< N, T >Abstract base class for nodes in a BBoxTree
geom::BBoxTreeTypes< N, T >Define types for a BBoxTree
geom::Circle3< T >A circle in 3-dimensional space
geom::CircularArc3< T >A circular arc in 3-dimensional space
geom::ComplexContentConstraint< Complex >Functor that evaluates the content constraint for a local simplicial mesh
geom::ComplexManifoldNorm2< Complex >Functor that evaluates the 2-norm of the quality metric for a local simplicial mesh
geom::ComplexManifoldNorm2Mod< Complex >Functor that evaluates the 2-norm of the modified quality metric for a local simplicial mesh
geom::ComplexNorm2< Complex >Functor that evaluates the 2-norm of the quality metric for a local simplicial mesh
geom::ComplexNorm2Mod< Complex >Functor that evaluates the 2-norm of the modified quality metric for a local simplicial mesh
geom::ComplexWithFreeVertex< QF, N, T >A local simplicial complex with a free node at the center
geom::ComplexWithFreeVertexOnManifold< QF, N, 1, _Manifold, T >A local simplicial complex with a free node on a manifold
geom::ComplexWithFreeVertexOnManifold< QF, N, 2, _Manifold, T >A local simplicial complex with a free node on a manifold
geom::ComplexWithFreeVertexOnManifoldBase< QF, N, M, _Manifold, T >A base class for a local simplicial complex with a free node on a manifold
geom::CyclicIndexA class for a cyclic index
EdgeIterator< _Mesh, Const >An iterator on edges in a simplicial mesh
geom::EdgeRemoval< _QualityMetric, _Point, _Number >Edge removal in a tetrahedral mesh
FaceIterator< M, _Face, _CellHandle >An iterator of faces in a simplicial mesh
geom::FaceRemoval< _QualityMetric, _Point, _Number >Edge removal in a tetrahedral mesh
geom::IndexedEdgePolyhedron< T >Class for an indexed edge polyhedron in 3-D
geom::IndSimpSet< _N, _M, _A, T, V, IS >Class for a mesh that stores vertices and indexed simplices
geom::IndSimpSetIncAdj< _N, _M, _A, T, V, IS >An indexed simplex set that stores vertex-simplex incidences and simplex adjacencies
geom::Interval< N, T >An axes-oriented interval in the specified dimension
geom::IsNotSharpAngle< SMR >Functor that returns true iff the boundary angle is not sharp
geom::ISS_Distance< ISS >Functor that returns the distance to a mesh
geom::ISS_Interpolate< ISS, F >Interpolation for an indexed simplex set with fields at the vertices
geom::ISS_SD_CloserPoint< ISS >Functor that returns a closer point to an (N-1)-D mesh in N-D space
geom::ISS_SD_CloserPointDirection< ISS >Functor that returns the closest point along a specified direction to an (N-1)-D mesh in N-D space
geom::ISS_SD_ClosestPoint< ISS >Functor that returns the closest point to an (N-1)-D mesh in N-D space
geom::ISS_SD_ClosestPointDirection< ISS >Functor that returns the closest point along a specified direction to an (N-1)-D mesh in N-D space
geom::ISS_SD_Distance< ISS >Functor that returns the signed distance to an (N-1)-D mesh in N-D space
geom::ISS_SimplexQuery< ISS >Simplex queries on an indexed simplex set
geom::ISS_VertexField< ISS, F >Indexed simplex set with fields at the vertices
IssiaFaceIterator< ISSIA >Face iterator in an indexed simplex set (mesh)
geom::Line_2< T >A line in 2-D
geom::Node_AllIncCells< Mesh >Node in a simplicial mesh that stores iterators to all incident cells
geom::Node_OneIncCell< Mesh >Vertex in a simplicial mesh that stores one cell incidence
geom::Node_VertSelf< Mesh >A node in a simplicial mesh that stores a vertex and an iterator to itself
geom::Node_VertSelfId< Mesh >A node in a simplicial mesh that stores a vertex, an iterator to itself, and an identifier
geom::ParametrizedLine< N, T >A parametrized line in N-D
geom::ParametrizedPlane< N, T >A parametrized plane in N-D
geom::Plane< T >A plane in 3 dimensions
PointsOnManifold< 3, 2, 1, T >Feature-based manifold data structure
PointsOnManifold< _N, 1, 1, T >Feature-based manifold data structure
geom::Polygon< T >Class for a polygon in 2-D
geom::RegularGrid< N, T >A regular grid in N-D
geom::ScanConversionPolygon< T >Class for a polygon in 2-D
geom::ScanConversionPolyhedron< T >A class for a polyhedron in 3-D designed for scan conversion
geom::Segment< N, T >A segment in N dimensional space
geom::SegmentMath< N, T >A segment in N dimensional space designed for doing math operations
geom::SemiOpenInterval< N, T >An axes-oriented semi-open interval in N dimensions
geom::Simplex< N, V, T >A simplex in N dimensions
geom::SimplexAdj< M >Simplex-simplex adjacencies in an M-D indexed simplex set
geom::SimplexAdjJac< N, T >Implements operations for the adjoint Jacobian matrix of a simplex
geom::SimplexAdjJacQF< N, T >Quality function of the Jacobian and its adjoint
geom::SimplexCondNum< N, T >Implements the condition number quality metric
geom::SimplexContent< N, M, T >Functor for the content of a simplex
geom::SimplexDeterminant< N, M, T >Functor for the determinant of the Jacobian matrix
SimplexIterator< ISS >A simplex iterator for a mesh
geom::SimplexJac< N, T >Implements operations for the Jacobian matrix of a simplex
geom::SimplexJacQF< N, T >Simplex quality functions of the Jacobian matrix
geom::SimplexMaximumEdgeLength< N, M, T >Functor for the minimum edge length of a simplex
geom::SimplexMeanRatio< N, T >Implements the mean ratio quality metric
geom::SimplexMinimumEdgeLength< N, M, T >Functor for the minimum edge length of a simplex
geom::SimplexModCondNum< N, T >Implements the modified condition number quality metric
geom::SimplexModDet< T >Implements operations for modifying the determinant of the Jacobian
geom::SimplexModMeanRatio< N, T >Implements the mean ratio quality metric
geom::SimplexWithFreeVertex< QF, N, T >A simplex with a free vertex
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >A simplicial mesh data structure
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::CellIteratorCompareFunctor for comparing cell iterators by their identifiers
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::FaceCompareFunctor for comparing faces
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::FaceIteratorCompareFunctor for comparing face iterators
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::IndSimpIterAn indexed simplex iterator for a SimpMeshRed
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::NodeIteratorCompareFunctor for comparing node iterators by their identifiers
geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::SimpIterA simplex iterator for a SimpMeshRed
geom::SmrCell< SMR >Cell in a simplicial mesh that stores handles to the adjacent cells
geom::SmrNode< SMR >Node in a simplicial mesh that stores iterators to all incident cells
geom::StructuredGrid< N, M, T >Class for a structured grid
geom::Triangle< N, T >A class for a triangle in N dimensions
geom::VertexSimplexInc< M >Vertex-simplex incidences in an M-D indexed simplex set

Generated on Fri Aug 24 12:56:00 2007 for Computational Geometry Package by  doxygen 1.4.7