Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 12]

Cxms::BarycentricVals	Structure for Barycentric coordinate calculations
Cxms::edgerecord	Defines an edge that intersects a breakline
Cxms::fSatisfies	Class used with the boost::geometry::index::satisfies function
Cxms::GmExtents2d	2D geometric extents (min/max)
Cxms::GmExtents3d	3D geometric extents (min/max)
▼Cxms::GmMultiPolyIntersectionSorter	Base class for sorting intersections from GmMultiPolyIntersector
Cxms::GmMultiPolyIntersectionSorterTerse	Class for sorting intersections from GmMultiPolyIntersector in a terse way (with no duplicate info)
▼Cxms::GmMultiPolyIntersector	See GmMultiPolyIntersectorImpl comments
Cxms::GmMultiPolyIntersectorImpl	Used to intersect a line segment with any number of polygons in 2D. Returns the intersected polygons in order along with t values. May be an alternative to SurfaceIter and feiTraverseLineSegment2
Cxms::GmMultiPolyIntersectorData	Struct used by GmMultiPolyIntersector
▼CGmPointInPolyUnitTests	Used for speed tests of various point in poly functions / classes
CGmPointInPolyTester_gmPointInPolygon2D	For testing point in polygon speed
CGmPointInPolyTester_GmPolygon	Helper class for testing GmPolygon
▼Cxms::GmPolygon	Interface to a boost::geometry::polygon class
Cxms::GmPolygonImpl	Wraps a boost polygon for point in poly, min distance from point to poly etc
▼Cxms::GmPolyLinePtRedistributer	Redistributes the point locations on a polyline based on a size
Cxms::GmPolyLinePtRedistributerImpl	Implementation of GmPolyLinePtRedistributer
▼Cxms::GmPtSearch	Spatial index for searching points
Cxms::GmPtSearchImpl	Implementation of GmPtSearch. Generic class for searching location data. Uses a boost R-tree to query a set of locations. Works for 2D and 3D
▼Cxms::GmTriSearch	Spatial index for searching triangles
Cxms::GmTriSearchImpl	Implementation of GmTriSearch
Cxms::idx_pt	Class for indexing the points
Cxms::idx_tri	Indexing for the spatial index
Cxms::XmUGrid::Impl	Implementation for XmUGrid
Cxms::ix	An intersection point of a line with a polygon
▼CTestSuite
CGeomsXmsngIntermediateTests	Intermediate tests for functions in geoms.cpp
CGeomsXmsngUnitTests	Tests for functions in geoms.cpp
CGmExtents3dUnitTests	Tests GmExtents3d
CGmMultiPolyIntersector2IntermediateTests	Tests for GmMultiPolyIntersector that take longer to run
CGmMultiPolyIntersectorUnitTests	Tests for GmMultiPolyIntersector
CGmPolygonIntermediateTests	Tests GmPolygonIntermediateTests
CGmPolygonUnitTests	Tests GmPolygon
CGmPolyLinePtRedistributerUnitTests	Tests GmPolyLinePtRedistributer
CPtSearchUnitTests	Tester for the PtSearch class
CTrAutoFixFourTrianglePtsUnitTests	Tests for TrAutoFixFourTrianglePts
CTrBreaklineAdderUnitTests	Tests for TrBreaklineAdder
CTriSearchUnitTests	Tester for the TriSearch class
CTrOuterTriangleDeleterUnitTests	Tests for TrOuterTriangleDeleter
CTrTinUnitTests	Tests for TrTin
CTrTriangulatorPointsUnitTests	Tests for TrTriangulatorPoints
CXmEdgeUnitTests	Test XmEdge class
CXmUGridUnitTests	Tests XmUGrids
CXmUGridUtilsTests	Tests for XmUGrid utility functions
▼Cxms::TrAutoFixFourTrianglePts
Cxms::TrAutoFixFourTrianglePtsImpl	Used to delete points that are connected to 4 triangles and then retriangulate the void
▼Cxms::TrBreaklineAdder	Adds breaklines to a tin
Cxms::TrBreaklineAdderImpl	Adds breaklines to a triangulation
▼Cxms::TrOuterTriangleDeleter
Cxms::TrOuterTriangleDeleterImpl	Used to delete tin triangles that are outside given polygons. The polygons may include holes - polygons inside polygons
▼Cxms::TrTin
Cxms::TrTinImpl	Class to encapsulate a tin made simply of arrays of points, triangles and adjacency information. Also methods to manipulate it
▼Cxms::TrTriangulator	Base class used to derive a class to triangulate points
Cxms::TrTriangulatorPoints	Class to triangulate simple points
Cxms::XmEdge	Two integer values representing an edge of an XmUGrid. By default has a direction. Can be sorted to have minimum index first
Cxms::XmUGrid	Geometry for an unstructured grid. An XmUGrid is defined as a vector of 3d points and a stream of cells. Throughout this interface, we use these terms: