| BezierEdge | The Edge type for BezierMesh |
| BezierMesh | The CellComplex of Bezier Cells |
| BezierTriangle | The Face type for BezierMesh |
| BezierVertex | The Vertex type for BezierMesh |
| BoundaryEdge | The Edge type for a BoundaryMesh |
| BoundaryFace | The Face type for a BoundaryMesh |
| BoundaryMesh | The CellComplex of Boundary elements |
| BoundaryVertex | The Vertex type for a BoundaryMesh |
| Tumble::iterators::caster< old_iterator, output_type, output_ref > | Wrap an iterator, changing the output type to a subclass. So we can take a list<Mammal*> and iterate over it as if it were a list<Cow*> using a: caster<list<Mammal*>::iterator, Cow*> |
| CastHash< T > | |
| Cell | The model for all Cells great and small |
| CellComplex< Vertex, Edge, Face, Tuple > | A toplogical data structure |
| CellTuple< Vertex, Edge, Face > | A Tuple of Cells |
| Cleaner | A class that impliments a standard cleaning process |
| Color | An RGB color |
| ConformalMesher | Tools to define a BoundaryMesh and use it to generate a BezierMesh |
| ControlPointHasher | A hasher for ControlPoints |
| CurvedTriangle | An abstract class that models a BezierTriangle without data |
| DataStore | Storage containers for geometric and functional mesh data |
| Tumble::iterators::dedereferencer< old_iterator, output_type, output_ref > | Take in an iterator and dereference it twice. So we can take a list<int**> and iterate over it as if it were a list<int> using a: dedereferencer<list<int**>::iterator, int> |
| Tumble::iterators::dereferencer< old_iterator, output_type, output_ref > | Take in an iterator and dereference it. So we can take a list<int*> and iterate over it as if it were a list<int> using a: dereferencer<list<int*>::iterator, int> |
| EdgeCell | The model for all Edges of a CellComplex |
| EPSWrite | Generates an Postcript program to display the mesh in EPS format |
| FaceCell | The model for all Faces of a CellComplex |
| FHeap< Data > | A templated implimentation of a fibonacci heap, derived from the abstract FibHeap |
| FibHeap | An abstract definition of a fibonacci heap |
| FibHeapNode | An abstract definition of a node of a FibHeap |
| GhostTriangle | A class to keep a copy of a BezierTriangle without all the CellComplex baggage |
| hashers::hash< BezierEdge * > | |
| hashers::hash< BezierTriangle * > | |
| hashers::hash< BezierVertex * > | |
| hashers::hash< BoundaryEdge * > | |
| hashers::hash< BoundaryFace * > | |
| hashers::hash< BoundaryVertex * > | |
| hashers::hash< Cell * > | |
| hashers::hash< const BezierEdge * > | |
| hashers::hash< const BezierTriangle * > | |
| hashers::hash< const BezierVertex * > | |
| hashers::hash< const BoundaryEdge * > | |
| hashers::hash< const BoundaryFace * > | |
| hashers::hash< const BoundaryVertex * > | |
| hashers::hash< const Cell * > | |
| hashers::hash< const EdgeCell * > | |
| hashers::hash< const FaceCell * > | |
| hashers::hash< const VertexCell * > | |
| hashers::hash< EdgeCell * > | |
| hashers::hash< FaceCell * > | |
| hashers::hash< VertexCell * > | |
| HeapNode< Data > | A templated node for a FHeap, derived from the abstract FibHeapNode |
| LinearData | A vector class used to represent functional data on the mesh |
| list | |
| Matrix | A standard dense matrix class |
| Matrix5 | A matrix class to hold matricies with a bandwidth of 5 |
| MeshBinaryInput | A class for creating a BezierMesh and BoundaryMesh from a binary input file |
| MeshBinaryOutput | A class for saving a BezierMesh and BoundaryMesh as a binary file |
| MeshConstructor | Tools to define a BoundaryMesh and use it to generate a BezierMesh |
| MeshInput | A class for creating a BezierMesh and BoundaryMesh from a quartet of text files |
| MeshInput::BezierEdgeData | |
| MeshInput::BezierTriangleData | |
| MeshInput::BoundaryEdgeData | |
| MeshInput::BoundaryFaceData | |
| MeshInput::BoundaryVertexData | |
| MeshInput::Node | |
| MeshOutput | A class for saving a BezierMesh and BoundaryMesh as a quartet of text files |
| PairHasher< CellA, CellB > | A template of a hasher for std:pair |
| PersistantArray< Datum, N > | |
| PersistantData< Datum > | |
| PersistantHashMap< Key, Value, HashFcn, EqualKey > | |
| PersistantHashSet< Key, HashFcn, EqualKey > | |
| PersistantList< Value > | |
| PersistantList< Value >::iterator | An iterator with read-write access. Use the access() function; otherwise, this is merely an iterator |
| PersistantMemoryPool< Datum > | |
| PersistantMemoryPool< Datum >::hashfcn | |
| PersistantStore | |
| PersistantVector< Datum > | |
| Point2D | A standard two dimensional Point/Vector class |
| PQueue< T > | A standard linked-list based priority queue templaye |
| PQueueEntry< T > | A container template for the a linked list priority queue |
| PSCoord | A struct for storing coordinates for Postscript |
| PSDrawMode | Controls for the EPSWrite class |
| QBSpline | A Quadratic B-Spline which is used to represent BoundaryEdges |
| Simulation | A class which unifies the BoundaryMesh and BezierMesh |
| TupleHasher< Tuple > | A template of a hasher for Tuples |
| Vec3D | A standard three dimentional vetor class |
| VertexCell | The model for all Vertexes of a CellComplex |
| Visualization | Provieds methods for displaying a mesh with OpenGL |
