| 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::BinarySearch< N, _Record, _Key, _MultiKeyAccessor > | Binary search of records in the final coordinate |
| geom::CellArray< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A cell array in N-D |
| geom::CellArrayBase< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | Base class for a cell array in N-D |
| geom::CellArrayStatic< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A static cell array in N-D |
| geom::CellBinarySearch< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A cell array in combined with a binary search in the final coordinate |
| geom::CellForwardSearch< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A cell array in combined with a forward search in the final coordinate |
| geom::CellForwardSearchKey< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A cell array in combined with a forward search on keys in the final coordinate |
| geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::CellIteratorCompare | Functor for comparing cell iterators by their identifiers |
| geom::CellSearch< N, _Record, _MultiKey, _Key, _MultiKeyAccessor, _Cell > | Base class for a cell array combined with a search structure |
| geom::Circle3< T > | A circle in 3-dimensional space |
| geom::CircularArc3< T > | A circular arc in 3-dimensional space |
| geom::CoarsenNull | Coarsening functor that does nothing |
| 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::CyclicIndex< _Index > | A class for a cyclic index |
| geom::DistributedOrthtree< _Orthtree > | An orthtree that uses distributed-memory concurrency |
| geom::EdgeIterator< _Mesh, Const > | An iterator on edges in a simplicial mesh |
| geom::EdgeRemoval< _QualityMetric, _Point, _Number > | Edge removal in a tetrahedral mesh |
| geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::FaceCompare | Functor for comparing faces |
| geom::FaceIterator< M, _Face, _CellHandle > | An iterator of faces in a simplicial mesh |
| geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::FaceIteratorCompare | Functor for comparing face iterators |
| geom::FaceRemoval< _QualityMetric, _Point, _Number > | Edge removal in a tetrahedral mesh |
| geom::ForwardSearch< N, _Record, _Key, _MultiKeyAccessor > | Data structure for performing forward searching on records |
| geom::ForwardSearchKey< N, _Record, _Key, _MultiKeyAccessor > | Data structure for performing forward searching on the keys of records |
| geom::IndexAndCell< Cell > | An index and cell for holding records |
| geom::IndexedEdgePolyhedron< T > | Class for an indexed edge polyhedron in 3-D |
| geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::IndSimpIter | An indexed simplex iterator for a SimpMeshRed |
| geom::IndSimpSet< _N, _M, T > | Class for a mesh that stores vertices and indexed simplices |
| geom::IndSimpSetIncAdj< _N, _M, T > | 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 |
| geom::IssiaFaceIterator< ISSIA > | Face iterator in an indexed simplex set (mesh) |
| geom::KDTree< N, _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | A kd-tree in N-D |
| geom::KDTreeBranch< N, _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | Class for an internal node in a KDTree |
| geom::KDTreeLeaf< N, _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | Class for a leaf in a KDTree |
| geom::KDTreeNode< N, _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | Abstract base class for nodes in a KDTree |
| geom::SortFirst< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompare | Less than comparison in a specified coordinate |
| geom::SortFirstDynamic< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompare | Less than comparison in a specified coordinate |
| geom::SortProject< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompare | Less than comparison in a specified coordinate |
| geom::SortProject< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompareMultiKeyAndValue | Less than comparison in a specified coordinate for a multi-key and a record iterator |
| geom::SortFirst< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompareMultiKeyAndValue | Less than comparison in the first coordinate for a multi-key and a record iterator |
| geom::SortProject< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompareValueAndMultiKey | Less than comparison in a specified coordinate for a record iterator and a multi-key |
| geom::SortFirst< N, _Record, _MultiKey, _Key, _MultiKeyAccessor >::LessThanCompareValueAndMultiKey | Less than comparison in the first coordinate for a record iterator and a multi-key |
| geom::LevelCoordinatesComposite< 2, _NumberOfLevels > | |
| geom::Line_2< T > | A line in 2-D |
| geom::MergeAverage | Merging functor that averages the values of the children |
| geom::MergeCopyFirst | Merging functor that copies the value of the first child |
| geom::MergeNull | Merging functor that does nothing |
| 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::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::NodeIteratorCompare | Functor for comparing node iterators by their identifiers |
| geom::Octree< _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | An octree in 3-D |
| geom::OctreeBranch< _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | A branch in an octree |
| geom::OctreeLeaf< _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | A leaf in an octree |
| geom::OctreeNode< _Record, _MultiKey, _Key, _MultiKeyAccessor, _RecordOutputIterator > | A node in an octree |
| geom::ORQ< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | Base class for an orthogonal range query data structure in N-D |
| geom::OrthtreeElementNull< _Dimension > | A null element. It holds no data |
| geom::OrthtreeMap< _Dimension, _MaximumLevel, _Element, _AutomaticBalancing, _Split, _Merge, _Refine, _Coarsen, _Action, _Key > | An orthant tree that uses std::map |
| geom::ParametrizedLine< N, T > | A parametrized line in N-D |
| geom::ParametrizedPlane< N, T > | A parametrized plane in N-D |
| geom::Placebo< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A placebo for ORQ's in N-D |
| geom::PlaceboCheck< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A placebo for ORQ's in N-D |
| geom::Plane< T > | A plane in 3 dimensions |
| geom::PointsOnManifold< 3, 2, 1, T > | Feature-based manifold data structure |
| geom::PointsOnManifold< _N, 1, 1, T > | Feature-based manifold data structure |
| geom::RefineNull | Refinement functor that does nothing |
| geom::RegularGrid< N, T > | A regular grid in N-D |
| geom::ScanConversionPolygon< _Index, T > | Class for a polygon in 2-D |
| geom::ScanConversionPolyhedron< _Index, T > | A class for a polyhedron in 3-D designed for scan conversion |
| geom::Search< N, _Record, _MultiKeyAccessor > | Base class for a search structure in the final coordinate |
| 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::SequentialScan< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | The sequential scan algorithm for ORQ's in N-D |
| geom::SimpMeshRed< _N, _M, T, _Node, _Cell, Container >::SimpIter | A simplex iterator for a SimpMeshRed |
| 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 |
| geom::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::SimplexJacStaticData< N > | Base class with const data |
| 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::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::SortFirst< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A sorted vector of records in N-D |
| geom::SortFirstDynamic< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A sorted vector of records in N-D |
| geom::SortProject< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A sorted vector of records in N-D |
| geom::SortRankProject< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A sorted and ranked vector of grid elements in N-D |
| geom::SparseCellArray< N, _Record, _MultiKey, _Key, _MultiKeyAccessor > | A sparse cell array in N-D |
| geom::SparseCellVector< Cell > | A vector of sparse cells |
| geom::SpatialIndex< _Dimension, _MaximumLevel > | N-D spatial index that uses both interlaced and non-interlaced representations |
| geom::SplitCopy | Splitting functor that copies the value of the parent |
| geom::SplitNull | Splitting functor that does nothing |
| 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 |