Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1234]
 NomplMain namespace. Contains everything in this library
 NbaseThis namespace contains sampling based planning routines shared by both planning under geometric constraints (geometric) and planning under differential constraints (dynamic)
 NcontrolThis namespace contains sampling based planning routines used by planning under differential constraints
 NgeometricThis namespace contains code that is specific to planning under geometric constraints
 NmsgMessage namespace. This contains classes needed to output error messages (or logging) from within the library. Message logging can be performed with logging macros
 NtoolsIncludes various tools such as self config, benchmarking, etc
 CBinaryHeapThis class provides an implementation of an updatable min-heap. Using it is a bit cumbersome, as it requires keeping track of the BinaryHeap::Element* type, however, it should be as fast as it gets with an updatable heap
 CDynamicSSSP
 CExceptionThe exception type for ompl
 CFLANNDistanceWrapper class to allow FLANN access to the NearestNeighbors::distFun_ callback function
 CGreedyKCentersAn instance of this class can be used to greedily select a given number of representatives from a set of data points that are all far apart from each other
 CGridRepresentation of a simple grid
 CGridBThis class defines a grid that keeps track of its boundary: it distinguishes between interior and exterior cells
 CGridNRepresentation of a grid where cells keep track of how many neighbors they have
 CLPAstarOnGraph
 CNearestNeighborsAbstract representation of a container that can perform nearest neighbors queries
 CNearestNeighborsFLANNWrapper class for nearest neighbor data structures in the FLANN library
 CNearestNeighborsFLANNHierarchicalClustering
 CNearestNeighborsFLANNLinear
 CNearestNeighborsGNATGeometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search
 CNearestNeighborsGNATNoThreadSafetyGeometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search
 CNearestNeighborsLinearA nearest neighbors datastructure that uses linear search
 CNearestNeighborsSqrtApproxA nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) elements only. (Every sqrt(n) elements are skipped)
 CPDFA container that supports probabilistic sampling over weighted data
 CPermutationA permutation of indices into an array
 CPPMLoad and save .ppm files - "portable pixmap format" an image file formats designed to be easily exchanged between platforms
 CProlateHyperspheroidA class describing a prolate hyperspheroid, a special symmetric type of n-dimensional ellipse, for use in direct informed sampling for problems seeking to minimize path length
 CRNGRandom number generation. An instance of this class cannot be used by multiple threads at once (member functions are not const). However, the constructor is thread safe and different instances can be used safely in any number of threads. It is also guaranteed that all created instances will have a different random seed
 NPoint2DPlanning
 CPlane2DEnvironment
 NstdSTL namespace
 Chash< std::pair< U, V > >
 CKoulesControlSampler
 CKoulesControlSpace
 CKoulesDecomposition
 CKoulesDirectedControlSampler
 CKoulesGoal
 CKoulesProjection
 CKoulesSimulator
 CKoulesStatePropagator