lsConvexHull.hpp File Reference

#include <lsPreCompileMacros.hpp>
#include <algorithm>
#include <list>
#include <unordered_map>
#include <lsGeometries.hpp>
#include <lsMesh.hpp>
#include <vcLogger.hpp>
#include <vcSmartPointer.hpp>
#include <vcVectorType.hpp>

Go to the source code of this file.

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

Namespaces
namespace	viennals