#include <qthread.h>
#include "qdutil.h"
#include "Qdos.h"
#include "qar.h"
Classes | |
class | Point2D |
class | Point3D |
class | Point4D |
class | Element2D |
class | Ridge3D |
class | Facet3D |
class | Element3D |
class | Ridge4D |
class | Facet4D |
Functions | |
void | quickHull (list< Point4D * > &points, list< Element3D > &delaunay) |
void | quickHull (list< Point3D * > &points, list< Element2D > &delaunay) |
void | triangulation (std::list< Point3D > &in, std::list< Element3D > &out) |
void | interpolation (list< Point3D > &points, list< Element3D > &hull) |
void | triangulation (std::list< Point2D > &in, std::list< Element2D > &out) |
void | interpolation (list< Point2D > &points, list< Element2D > &hull) |
void | test_integration_oversampling () |
void | test_integration_subsampling () |
void | test2 () |
void | test2D () |
void | test3D () |
void | test3Dsphere () |
void | testRealConditions3D () |
void | testRealConditions2D (bool with_plot) |
Computes the Delaunay triangulation of the (x,y) projection of a set of 3D points, using the QuickHull algorithm.
points | The set of 3D points | |
hull | The output list of Element2D (Delaunay trangulation) |
Computes the Delaunay triangulation of the (x,y,z) projection of a set of 4D points, using the QuickHull algorithm.
points | The set of 4D points | |
hull | The output list of Element3D (Delaunay trangulation) |
void test2 | ( | ) |
void test2D | ( | ) |
void test3D | ( | ) |
void test3Dsphere | ( | ) |
void test_integration_oversampling | ( | ) |
void test_integration_subsampling | ( | ) |
void testRealConditions2D | ( | bool | with_plot | ) |
void testRealConditions3D | ( | ) |