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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/**
* $Id$
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
*/
#ifndef NAN_INCLUDED_MeshBounds_h
#define NAN_INCLUDED_MeshBounds_h
#include "MEM_SmartPtr.h"
#include "LOD_MeshPrimitives.h"
#include "LOD_ManMesh2.h"
#include "MT_assert.h"
// simple class to compute the mesh bounds of a manifold mesh,
class LOD_MeshBounds {
public :
static
LOD_MeshBounds *
New(
){
MEM_SmartPtr<LOD_MeshBounds> output(new LOD_MeshBounds());
return output.Release();
}
void
ComputeBounds(
const LOD_ManMesh2 * mesh
){
MT_assert(mesh!=NULL);
MT_assert(mesh->VertexSet().size() > 0);
const std::vector<LOD_Vertex> &verts = mesh->VertexSet();
m_min = verts[0].pos;
m_max = verts[0].pos;
// iterate through the verts
int t;
const int size = verts.size();
for (t=1; t< size ; ++t) {
UpdateBounds(verts[t].pos,m_min,m_max);
}
}
MT_Vector3
Min(
) const {
return m_min;
}
MT_Vector3
Max(
) const {
return m_max;
}
private :
void
UpdateBounds(
MT_Vector3 vertex,
MT_Vector3& min,
MT_Vector3& max
) {
if (vertex.x() < min.x()) {
min.x() = vertex.x();
} else
if (vertex.x() > max.x()) {
max.x()= vertex.x();
}
if (vertex.y() < min.y()) {
min.y() = vertex.y();
} else
if (vertex.y() > max.y()) {
max.y()= vertex.y();
}
if (vertex.z() < min.z()) {
min.z() = vertex.z();
} else
if (vertex.z() > max.z()) {
max.z()= vertex.z();
}
}
LOD_MeshBounds(
) :
m_min(0,0,0),
m_max(0,0,0)
{
};
MT_Vector3 m_min;
MT_Vector3 m_max;
};
#endif
|
