![]() |
SynAPSE
0.6.0
Synergistic Analysis of Phase Space Evolution
|
Computes the Delaunay triangulation of a set of points. More...
#include <Delaunay.hh>
Public Member Functions | |
| Delaunay () | |
| Default constructor, initilizes everything to 0. More... | |
| Delaunay (const std::vector< Vertex > &vertices) | |
| Normal constructor, sets the vector of vertices. More... | |
| Delaunay (const std::vector< std::vector< double >> &vertices) | |
| Normal constructor, sets the vector of points. More... | |
| Delaunay (const Delaunay &del) | |
| Copy constructor. More... | |
| Delaunay & | operator= (const Delaunay &del) |
| Equality operator. More... | |
| ~Delaunay () | |
| Destructor. More... | |
| bool | Initialize () |
| Find the Delaunay triangulation of the N vertices. More... | |
| const size_t & | GetDimension () const |
| Returns the dimension of the space in which the tesselation is constructed. More... | |
| const std::vector< Vertex > & | GetVertexArray () const |
| Returns the array of vertices on which the triangulation is constructed. More... | |
| const Vertex & | GetVertex (const size_t i) const |
| Returns a specific vertex. More... | |
| const std::vector< Vertex > & | GetBestFacet (const std::vector< double > &v, bool *isin=NULL) const |
| Finds the closest facet and returns its vertices. More... | |
| std::vector< TPolyLine * > | Polygons () const |
| Returns an array of polygons to be drawn in ROOT (only 2D) More... | |
Private Attributes | |
| size_t | _dim |
| Dimension of the space. More... | |
| std::vector< Vertex > | _vertices |
| Vector of N vertices. More... | |
| std::map< size_t, std::vector < Vertex > > | _facets |
| Map of facets (simplices) More... | |
| orgQhull::Qhull * | _qhull |
| Pointer to qhull object, owns the memory. More... | |
Computes the Delaunay triangulation of a set of points.
The Delaunay triangulation is obtained by computing the (n+1)-dimensional convex hull of the points by adding the L2 vector norm as an additional coordinate. This forms a paraboloid which projected bottom end corresponds to the triangulation. Qhull performs the heavy lifting, this is a front end class.
| Delaunay::Delaunay | ( | ) |
Default constructor, initilizes everything to 0.
| Delaunay::Delaunay | ( | const std::vector< Vertex > & | vertices | ) |
Normal constructor, sets the vector of vertices.
| vertices | Vector of vertices |
| Delaunay::Delaunay | ( | const std::vector< std::vector< double >> & | vertices | ) |
Normal constructor, sets the vector of points.
| vertices | Vector of points |
| Delaunay::Delaunay | ( | const Delaunay & | del | ) |
Copy constructor.
| Delaunay::~Delaunay | ( | ) |
Destructor.
| const std::vector< Vertex > & Delaunay::GetBestFacet | ( | const std::vector< double > & | v, |
| bool * | isin = NULL |
||
| ) | const |
Finds the closest facet and returns its vertices.
|
inline |
Returns the dimension of the space in which the tesselation is constructed.
|
inline |
Returns a specific vertex.
|
inline |
Returns the array of vertices on which the triangulation is constructed.
| bool Delaunay::Initialize | ( | ) |
Find the Delaunay triangulation of the N vertices.
| std::vector< TPolyLine * > Delaunay::Polygons | ( | ) | const |
Returns an array of polygons to be drawn in ROOT (only 2D)
|
private |
Dimension of the space.
|
private |
Map of facets (simplices)
|
private |
Pointer to qhull object, owns the memory.
1.8.6