▼Nxms | XMS Namespace |
CBarycentricVals | Structure for Barycentric coordinate calculations |
Cedgerecord | Defines an edge that intersects a breakline |
CfSatisfies | Class used with the boost::geometry::index::satisfies function |
CGmExtents2d | 2D geometric extents (min/max) |
CGmExtents3d | 3D geometric extents (min/max) |
CGmMultiPolyIntersectionSorter | Base class for sorting intersections from GmMultiPolyIntersector |
CGmMultiPolyIntersectionSorterTerse | Class for sorting intersections from GmMultiPolyIntersector in a terse way (with no duplicate info) |
CGmMultiPolyIntersector | See GmMultiPolyIntersectorImpl comments |
CGmMultiPolyIntersectorData | Struct used by GmMultiPolyIntersector |
CGmMultiPolyIntersectorImpl | 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 |
CGmPolygon | Interface to a boost::geometry::polygon class |
CGmPolygonImpl | Wraps a boost polygon for point in poly, min distance from point to poly etc |
CGmPolyLinePtRedistributer | Redistributes the point locations on a polyline based on a size |
CGmPolyLinePtRedistributerImpl | Implementation of GmPolyLinePtRedistributer |
CGmPtSearch | Spatial index for searching points |
CGmPtSearchImpl | 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 |
CGmTriSearch | Spatial index for searching triangles |
CGmTriSearchImpl | Implementation of GmTriSearch |
Cidx_pt | Class for indexing the points |
Cidx_tri | Indexing for the spatial index |
Cix | An intersection point of a line with a polygon |
CTrAutoFixFourTrianglePts | |
CTrAutoFixFourTrianglePtsImpl | Used to delete points that are connected to 4 triangles and then retriangulate the void |
CTrBreaklineAdder | Adds breaklines to a tin |
CTrBreaklineAdderImpl | Adds breaklines to a triangulation |
CTrOuterTriangleDeleter | |
CTrOuterTriangleDeleterImpl | Used to delete tin triangles that are outside given polygons. The polygons may include holes - polygons inside polygons |
CTrTin | |
CTrTinImpl | Class to encapsulate a tin made simply of arrays of points, triangles and adjacency information. Also methods to manipulate it |
CTrTriangulator | Base class used to derive a class to triangulate points |
CTrTriangulatorPoints | Class to triangulate simple points |
CXmEdge | Two integer values representing an edge of an XmUGrid. By default has a direction. Can be sorted to have minimum index first |
▼CXmUGrid | 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: |
CImpl | Implementation for XmUGrid |
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 |
CGmPointInPolyTester_gmPointInPolygon2D | For testing point in polygon speed |
CGmPointInPolyTester_GmPolygon | Helper class for testing GmPolygon |
CGmPointInPolyUnitTests | Used for speed tests of various point in poly functions / classes |
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 |