Class Hierarchy

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

[detail level 123]

▼CBasePlacement
CCGAL::Surface_mesh_simplification::FurtherConstrainedPlacement< BasePlacement, EdgeIsConstrainedMap, VertexIsConstrainedMap >	Constrained placement class for CGAL::Surface_mesh_simplification, extending the normal constrained placement to allow maintaining border vertices as well as corners in a tile
CBorder_is_constrained_edge_map
CBorderEdgesAreConstrainedEdgeMap< Polyhedron >	BGL property map indicating whether an edge is marked as non-removable
CBordersData	Structure storing the data for the borders of a tile. This includes the 4 east-west-north-south borders, as well as the corners
CBorderVertex	Class storing a vertex on the border of a tile
CTinCreation::CompareGIHeapNodes	Comparison operator (less than) for GIHeapNodes
CCGAL::Constrained_triangulation_plus_2< Tr >
CCGAL::Constrained_triangulation_plus_2< CDTXY >
CCornerVerticesAreConstrainedVertexMap< Polyhedron >	BGL property map indicating whether a given vertex is one of the 4 corners of the tile
CQuantizedMesh::EdgeIndices
▼CEllipsoid	Describes an ellipsoid
CWGS84Ellipsoid	The WGS84 ellipsoid
CExtractPolylinesVisitor< Graph, Polyline >	Visitor used by the extract_polylines_from_sharp_edges function
CTinCreation::GIFaceInfo	Additional information associated to a face in a Delaunay triangulation required by the Greedy Insertion algorithm
CTinCreation::GIHeapNode	The information to be maintained in the heap structure
CGZipFileReader	Helper class to read a GZip file
CGZipFileWriter	Helper class to write a GZip file
CQuantizedMesh::Header
CQuantizedMesh::IndexData
CIsSharpEdge< Surface_mesh, EdgeIsSharpMap >	Struct/functor that returns true if the edge is sharp (given a previously computed edgeIsSharp map)
▼CModifier_base
CPolyhedronBuilderFromC3T3Boundary< C3T3, HDS >	A modifier creating a Polyhedron_3 structure with the incremental builder from the boundary in a C3T3
CPolyhedronBuilderFromProjectedTriangulation< ProjectedTriangulation2, HDS >	A modifier creating a Polyhedron_3 structure with the incremental builder from a projected triangulation. A "projected triangulation" is a Triangulation_2 with projection traits. That is, the triangulation was made on the plane, but the internal points are 3D
CCGAL::Polyline_simplification_2::PointSetFeaturesSimplificationCost	Polyline simplification cost function used by point set simplification methods
▼CProjection_traits_3
CCGAL::internal::Projection_traits_3_extended< R, dim >
▼CCGAL::internal::Projection_traits_3_extended< R, 0 >
CCGAL::Projection_traits_yz_3_extended< R >
▼CCGAL::internal::Projection_traits_3_extended< R, 1 >
CCGAL::Projection_traits_xz_3_extended< R >
▼CCGAL::internal::Projection_traits_3_extended< R, 2 >
CCGAL::Projection_traits_xy_3_extended< R >
CQuantizedMeshTiler::QMTOptions
▼CQuantizedMesh	Contains all the data of a Quantized-mesh
CQuantizedMeshTile	Encapsulates a Tile in Quantized Mesh format *
CQuantizedMeshTilesPyramidBuilder	Contains the logic to create the pyramid of tiles in quantized mesh format
▼CSquared_distance_projected_3
CCGAL::internal::Squared_distance_projected_3_extended< R, dim >	Class extending the functionality of CGAL::internal::Squared_distance_projected_3 We had to modify the original CGAL's Projection_traits because they didn't implement the squared distance computation between a Segment and a Point (required by the Polyline_2 simplification algorithm)
▼CTerrainTiler
CQuantizedMeshTiler	Tiler of a terrain generating quantized-mesh tiles
▼CTile
CQuantizedMeshTile	Encapsulates a Tile in Quantized Mesh format *
CTileBorderVertices	Stores the vertices on the borders of a tile
▼CTinCreation::TinCreationStrategy	Defines the interphase of a TIN creation algorithm
CTinCreation::TinCreationDelaunayStrategy	A Delaunay triangulation is created with the input points, no simplification is applied
CTinCreation::TinCreationGreedyInsertionStrategy	Creates a TIN using the Greedy Insertion method
CTinCreation::TinCreationRemeshingStrategy	Creates a TIN using Delaunay refinement algorithm
CTinCreation::TinCreationSimplificationLindstromTurkStrategy	Creates a TIN using an edge-collapse simplification method
▼CTinCreation::TinCreationSimplificationPointSet	Creates a TIN using a point set simplification algorithm
CTinCreation::TinCreationSimplificationPointSetGrid	Creates a TIN using the Grid point set simplification algorithm
CTinCreation::TinCreationSimplificationPointSetHierarchy	Creates a TIN using the Hierarchical point set simplification algorithm
CTinCreation::TinCreationSimplificationPointSetRandom	Creates a TIN using a random simplification
CTinCreation::TinCreationSimplificationPointSetWLOP	Creates a TIN using the Weighted Locally Optimal Projection (WLOP) algorithm
CTinCreation::TinCreator	Main class used to create a TIN from an input set of points
CQuantizedMesh::VertexData
CQuantizedMesh::VertexNormals
CQuantizedMesh::WaterMask
CZoomTilesBorderVerticesCache	Cache to store/reuse the vertices at the borders for tiles that have been already constructed for a given zoom
CZoomTilesScheduler	Context class: Allows to change the algorithm at runtime
▼CZoomTilesSchedulerStrategy	An instance of a ZoomTilesSchedulerStrategy rules the desired order at which tiles in a given zoom should be processed (see derived classes for concrete strategies)
CZoomTilesSchedulerChessboardStrategy	Chessboard scheduler
CZoomTilesSchedulerColumnwiseStrategy	Column-wise scheduler
CZoomTilesSchedulerFourConnectedStrategy	Recursive scheduler
CZoomTilesSchedulerRecursiveFourConnectedStrategy	Recursive scheduler
CZoomTilesSchedulerRowwiseStrategy	Row-wise scheduler