SynAPSE  0.6.0
Synergistic Analysis of Phase Space Evolution
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends
Public Member Functions | Private Attributes
Delaunay Class Reference

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...
 

Detailed Description

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.

Constructor & Destructor Documentation

Delaunay::Delaunay ( )

Default constructor, initilizes everything to 0.

Delaunay::Delaunay ( const std::vector< Vertex > &  vertices)

Normal constructor, sets the vector of vertices.

Parameters
verticesVector of vertices
Delaunay::Delaunay ( const std::vector< std::vector< double >> &  vertices)

Normal constructor, sets the vector of points.

Parameters
verticesVector of points
Delaunay::Delaunay ( const Delaunay &  del)

Copy constructor.

Delaunay::~Delaunay ( )

Destructor.

Member Function Documentation

const std::vector< Vertex > & Delaunay::GetBestFacet ( const std::vector< double > &  v,
bool *  isin = NULL 
) const

Finds the closest facet and returns its vertices.

const size_t& Delaunay::GetDimension ( ) const
inline

Returns the dimension of the space in which the tesselation is constructed.

const Vertex& Delaunay::GetVertex ( const size_t  i) const
inline

Returns a specific vertex.

const std::vector<Vertex>& Delaunay::GetVertexArray ( ) const
inline

Returns the array of vertices on which the triangulation is constructed.

bool Delaunay::Initialize ( )

Find the Delaunay triangulation of the N vertices.

Delaunay & Delaunay::operator= ( const Delaunay &  del)

Equality operator.

std::vector< TPolyLine * > Delaunay::Polygons ( ) const

Returns an array of polygons to be drawn in ROOT (only 2D)

Field Documentation

size_t Delaunay::_dim
private

Dimension of the space.

std::map<size_t, std::vector<Vertex> > Delaunay::_facets
private

Map of facets (simplices)

orgQhull::Qhull* Delaunay::_qhull
private

Pointer to qhull object, owns the memory.

std::vector<Vertex> Delaunay::_vertices
private

Vector of N vertices.


The documentation for this class was generated from the following files: