viennals::ConvexHull< T, D > Class Template Reference

This algorithm creates a convex hull mesh from a point cloud. This is done using the gift wrapping approach. The points in the point cloud MUST be unique, otherwise this will fail. More...

#include <lsConvexHull.hpp>

Public Member Functions
	ConvexHull ()
	ConvexHull (SmartPointer< Mesh< T > > passedMesh, SmartPointer< PointCloud< T, D > > passedPointCloud)
void	setMesh (SmartPointer< Mesh< T > > passedMesh)
void	setPointCloud (SmartPointer< PointCloud< T, D > > passedPointCloud)
void	apply ()

Detailed Description

template<class T, int D>
class viennals::ConvexHull< T, D >

This algorithm creates a convex hull mesh from a point cloud. This is done using the gift wrapping approach. The points in the point cloud MUST be unique, otherwise this will fail.

Constructor & Destructor Documentation

ConvexHull() [1/2]

template<class T , int D>

viennals::ConvexHull< T, D >::ConvexHull ( )

inline

ConvexHull() [2/2]

template<class T , int D>

viennals::ConvexHull< T, D >::ConvexHull ( SmartPointer< Mesh< T > > passedMesh, SmartPointer< PointCloud< T, D > > passedPointCloud )

inline

Member Function Documentation

apply()

template<class T , int D>

void viennals::ConvexHull< T, D >::apply ( )

inline

setMesh()

template<class T , int D>

void viennals::ConvexHull< T, D >::setMesh ( SmartPointer< Mesh< T > > passedMesh )

inline

setPointCloud()

template<class T , int D>

void viennals::ConvexHull< T, D >::setPointCloud ( SmartPointer< PointCloud< T, D > > passedPointCloud )

inline

---

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

• include/viennals/lsConvexHull.hpp