src
ConvexDecomposition
triangulate.h
Go to the documentation of this file.
1
#ifndef TRIANGULATE_H
2
3
#define TRIANGULATE_H
4
61
namespace
ConvexDecomposition
62
{
63
64
// all 3d triangles should be co-planer. Doesn't bother to check, you should have done that yourself to begin with!
65
unsigned
int
triangulate3d
(
unsigned
int
pcount,
// number of points in the polygon
66
const
double
*vertices,
// array of 3d vertices.
67
double
*triangles,
// memory to store output triangles
68
unsigned
int
maxTri,
69
const
double
*plane);
// maximum triangles we are allowed to output.
70
71
unsigned
int
triangulate3d
(
unsigned
int
pcount,
// number of points in the polygon
72
const
unsigned
int
*indices,
// polygon points using indices
73
const
double
*vertices,
// base address for array indexing
74
double
*triangles,
// buffer to store output 3d triangles.
75
unsigned
int
maxTri,
76
const
double
*plane);
// maximum triangles we can output.
77
78
unsigned
int
triangulate2d
(
unsigned
int
pcount,
// number of points in the polygon
79
const
double
*vertices,
// address of input points (2d)
80
double
*triangles,
// destination buffer for output triangles.
81
unsigned
int
maxTri);
// maximum number of triangles we can store.
82
83
};
84
85
#endif
ConvexDecomposition
Definition:
bestfit.cpp:75
ConvexDecomposition::triangulate3d
unsigned int triangulate3d(unsigned int pcount, const double *vertices, double *triangles, unsigned int maxTri, const double *plane)
Definition:
triangulate.cpp:203
ConvexDecomposition::triangulate2d
unsigned int triangulate2d(unsigned int pcount, const double *vertices, double *triangles, unsigned int maxTri)
Definition:
triangulate.cpp:368
convex_decomposition
Author(s): John W. Ratcliff
autogenerated on Wed Mar 2 2022 00:04:59