1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
#ifndef MY_TRIANGULATOR
#define MY_TRIANGULATOR
#include <vector>
#include "MultiDimOctree.h"
#include "EdgeIntersectionFunctor.h"
#include "VertexHeap.h"
#include "psurfaceAPI.h"
namespace psurface {
template <class ctype> class CircularPatch;
template <int dim, class ctype> class PSurface;
struct QualityRequest;
extern int debugCounter;
/** This class encapsulates algorithms that triangulates small circular
and semi-circular patches. */
namespace Triangulator {
/// Return orientation (-1 -> clockwise, 0 -> collinear, 1 -> counterclockwise).
signed char PSURFACE_API orientation(const StaticVector<float,2>& a, const StaticVector<float,2>& b, const StaticVector<float,2>& c, const float eps=0.0);
/// performs a flattening described in MAPS (SIGGRAPH 98) and a constrained Delaunay triangulation.
void PSURFACE_API triangulateStar(const std::vector<int> &border, int center,
CircularPatch<float>& resultPatch, std::vector<StaticVector<float,2> >& flatBorder,
PSurface<2,float>* par);
///
void PSURFACE_API triangulateHalfStar(const std::vector<int> &border,
int center,
CircularPatch<float>& resultPatch,
std::vector<StaticVector<float,2> >& flatBorder,
PSurface<2,float>* par);
/// performs a flattening described in MAPS (SIGGRAPH 98) and a constrained Delaunay triangulation.
void PSURFACE_API estimateStarError(const std::vector<int>& border, int center,
const QualityRequest &quality,
const std::vector<int> &fullStar,
VertexHeap::ErrorValue& qualityValue,
MultiDimOctree<Edge, EdgeIntersectionFunctor, float, 3>& edgeOctree,
PSurface<2,float>* par);
///
void PSURFACE_API estimateHalfStarError(const std::vector<int> &border, int center,
const QualityRequest &quality,
const std::vector<int> &fullStar,
VertexHeap::ErrorValue& qualityValue,
MultiDimOctree<Edge, EdgeIntersectionFunctor, float, 3>& edgeOctree,
PSurface<2,float>* par);
void PSURFACE_API planeCDT(const std::vector<StaticVector<float,2> >& flatBorder, const std::vector<int>& border,
CircularPatch<float>& result, PSurface<2,float>* par);
bool PSURFACE_API isLegalEdge(const StaticVector<float,2>& a, const StaticVector<float,2>& b, const StaticVector<float,2>& c,
const std::vector<StaticVector<float,2> > &polygon);
inline float computeAspectRatio(const StaticVector<float,3>& x1, const StaticVector<float,3>& x2, const StaticVector<float,3>& x3) {
const float a = (x1 - x2).length();
const float b = (x2 - x3).length();
const float c = (x3 - x1).length();
const float aR = 2*a*b*c/((-a+b+c)*(a-b+c)*(a+b-c));
return fabs(aR);
}
/// makes an overall evaluation of a CircularPatch using the given QualityRequest object
void PSURFACE_API evaluate(const CircularPatch<float>* cP, int removedVertex,
const QualityRequest &quality,
VertexHeap::ErrorValue& qualityValue,
const std::vector<int> &fullStar,
MultiDimOctree<Edge, EdgeIntersectionFunctor, float, 3>& edgeOctree,
const PSurface<2,float>* par);
};
} // namespace psurface
#endif
|
