blob: 66dad69f8a99db56ff1c816fdb79395ac1dc4a4e (
plain)
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
86
87
88
89
90
91
92
93
94
|
// This code is in the public domain -- castano@gmail.com
#include "nvmesh.h" // pch
#include "Vertex.h"
#include "nvmath/Vector.inl"
using namespace nv;
using namespace HalfEdge;
// Set first edge of all colocals.
void Vertex::setEdge(Edge * e)
{
for (VertexIterator it(colocals()); !it.isDone(); it.advance()) {
it.current()->edge = e;
}
}
// Update position of all colocals.
void Vertex::setPos(const Vector3 & p)
{
for (VertexIterator it(colocals()); !it.isDone(); it.advance()) {
it.current()->pos = p;
}
}
uint HalfEdge::Vertex::colocalCount() const
{
uint count = 0;
for (ConstVertexIterator it(colocals()); !it.isDone(); it.advance()) { ++count; }
return count;
}
uint HalfEdge::Vertex::valence() const
{
uint count = 0;
for (ConstEdgeIterator it(edges()); !it.isDone(); it.advance()) { ++count; }
return count;
}
const HalfEdge::Vertex * HalfEdge::Vertex::firstColocal() const
{
uint firstId = id;
const Vertex * vertex = this;
for (ConstVertexIterator it(colocals()); !it.isDone(); it.advance())
{
if (it.current()->id < firstId) {
firstId = vertex->id;
vertex = it.current();
}
}
return vertex;
}
HalfEdge::Vertex * HalfEdge::Vertex::firstColocal()
{
Vertex * vertex = this;
uint firstId = id;
for (VertexIterator it(colocals()); !it.isDone(); it.advance())
{
if (it.current()->id < firstId) {
firstId = vertex->id;
vertex = it.current();
}
}
return vertex;
}
bool HalfEdge::Vertex::isFirstColocal() const
{
return firstColocal() == this;
}
bool HalfEdge::Vertex::isColocal(const Vertex * v) const {
if (this == v) return true;
if (pos != v->pos) return false;
for (ConstVertexIterator it(colocals()); !it.isDone(); it.advance())
{
if (v == it.current()) {
return true;
}
}
return false;
}
|