OGRE  1.9.0
OgreEdgeListBuilder.h
Go to the documentation of this file.
1/*
2-----------------------------------------------------------------------------
3This source file is part of OGRE
4 (Object-oriented Graphics Rendering Engine)
5For the latest info, see http://www.ogre3d.org/
6
7Copyright (c) 2000-2014 Torus Knot Software Ltd
8
9Permission is hereby granted, free of charge, to any person obtaining a copy
10of this software and associated documentation files (the "Software"), to deal
11in the Software without restriction, including without limitation the rights
12to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13copies of the Software, and to permit persons to whom the Software is
14furnished to do so, subject to the following conditions:
15
16The above copyright notice and this permission notice shall be included in
17all copies or substantial portions of the Software.
18
19THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25THE SOFTWARE.
26-----------------------------------------------------------------------------
27*/
28#ifndef __EdgeListBuilder_H__
29#define __EdgeListBuilder_H__
30
31#include "OgrePrerequisites.h"
32#include "OgreVector4.h"
34#include "OgreRenderOperation.h"
35#include "OgreHeaderPrefix.h"
36
37namespace Ogre {
53 {
54 public:
55
57
59 struct Triangle {
62 size_t indexSet;
64 size_t vertexSet;
66 size_t vertIndex[3];
69 size_t sharedVertIndex[3];
70
71 Triangle() :indexSet(0), vertexSet(0) {}
72 };
74 struct Edge {
78 size_t triIndex[2];
81 size_t vertIndex[2];
83 size_t sharedVertIndex[2];
86 };
87
91 typedef std::vector<Vector4, STLAllocator<Vector4, CategorisedAlignAllocPolicy<MEMCATEGORY_GEOMETRY> > > TriangleFaceNormalList;
92
97
100
103 {
105 size_t vertexSet;
112 size_t triStart;
114 size_t triCount;
117
118 };
119
121
134
135
145 void updateTriangleLightFacing(const Vector4& lightPos);
151 void updateFaceNormals(size_t vertexSet, const HardwareVertexBufferSharedPtr& positionBuffer);
152
153
154
156 void log(Log* log);
157
158 };
159
170 {
171 public:
172
180 void addVertexData(const VertexData* vertexData);
191 void addIndexData(const IndexData* indexData, size_t vertexSet = 0,
192 RenderOperation::OperationType opType = RenderOperation::OT_TRIANGLE_LIST);
193
199
201 void log(Log* l);
202 protected:
203
211 size_t index;
212 size_t vertexSet;
213 size_t indexSet;
215 };
217 struct Geometry {
218 size_t vertexSet;
219 size_t indexSet;
222 };
225 bool operator()(const Geometry& a, const Geometry& b) const
226 {
227 if (a.vertexSet < b.vertexSet) return true;
228 if (a.vertexSet > b.vertexSet) return false;
229 return a.indexSet < b.indexSet;
230 }
231 };
233 struct vectorLess {
234 bool operator()(const Vector3& a, const Vector3& b) const
235 {
236 if (a.x < b.x) return true;
237 if (a.x > b.x) return false;
238 if (a.y < b.y) return true;
239 if (a.y > b.y) return false;
240 return a.z < b.z;
241 }
242 };
243
247
258 typedef multimap< std::pair<size_t, size_t>, std::pair<size_t, size_t> >::type EdgeMap;
260
261 void buildTrianglesEdges(const Geometry &geometry);
262
264 size_t findOrCreateCommonVertex(const Vector3& vec, size_t vertexSet,
265 size_t indexSet, size_t originalIndex);
267 void connectOrCreateEdge(size_t vertexSet, size_t triangleIndex, size_t vertIndex0, size_t vertIndex1,
268 size_t sharedVertIndex0, size_t sharedVertIndex1);
269 };
273}
274
275#include "OgreHeaderSuffix.h"
276
277#endif
278
#define _OgreExport
Superclass for all objects that wish to use custom memory allocators when their new / delete operator...
This class contains the information required to describe the edge connectivity of a given set of vert...
vector< char >::type TriangleLightFacingList
Working vector used when calculating the silhouette.
void updateFaceNormals(size_t vertexSet, const HardwareVertexBufferSharedPtr &positionBuffer)
Updates the face normals for this edge list based on (changed) position information,...
vector< EdgeGroup >::type EdgeGroupList
void log(Log *log)
Debugging method.
std::vector< Vector4, STLAllocator< Vector4, CategorisedAlignAllocPolicy< MEMCATEGORY_GEOMETRY > > > TriangleFaceNormalList
Array of 4D vector of triangle face normal, which is unit vector orthogonal to the triangles,...
TriangleLightFacingList triangleLightFacings
Triangle light facing states.
bool isClosed
Flag indicate the mesh is manifold.
EdgeGroupList edgeGroups
All edge groups of this edge list.
vector< Edge >::type EdgeList
void updateTriangleLightFacing(const Vector4 &lightPos)
Calculate the light facing state of the triangles in this edge list.
vector< Triangle >::type TriangleList
TriangleFaceNormalList triangleFaceNormals
All triangle face normals.
TriangleList triangles
Main triangles array, stores all triangles of this edge list.
General utility class for building edge lists for geometry.
multimap< std::pair< size_t, size_t >, std::pair< size_t, size_t > >::type EdgeMap
Edge map, used to connect edges.
vector< CommonVertex >::type CommonVertexList
CommonVertexMap mCommonVertexMap
void connectOrCreateEdge(size_t vertexSet, size_t triangleIndex, size_t vertIndex0, size_t vertIndex1, size_t sharedVertIndex0, size_t sharedVertIndex1)
Connect existing edge or create a new edge - utility method during building.
void log(Log *l)
Debugging method.
void buildTrianglesEdges(const Geometry &geometry)
void addVertexData(const VertexData *vertexData)
Add a set of vertex geometry data to the edge builder.
vector< Geometry >::type GeometryList
EdgeData * build(void)
Builds the edge information based on the information built up so far.
map< Vector3, size_t, vectorLess >::type CommonVertexMap
Map for identifying common vertices.
vector< constVertexData * >::type VertexDataList
size_t findOrCreateCommonVertex(const Vector3 &vec, size_t vertexSet, size_t indexSet, size_t originalIndex)
Finds an existing common vertex, or inserts a new one.
void addIndexData(const IndexData *indexData, size_t vertexSet=0, RenderOperation::OperationType opType=RenderOperation::OT_TRIANGLE_LIST)
Add a set of index geometry data to the edge builder.
virtual ~EdgeListBuilder()
Shared pointer implementation used to share vertex buffers.
Summary class collecting together index data source information.
OperationType
The rendering operation type to perform.
Standard 3-dimensional vector.
Definition OgreVector3.h:52
4-dimensional homogeneous vector.
Definition OgreVector4.h:46
Summary class collecting together vertex source information.
A group of edges sharing the same vertex data.
const VertexData * vertexData
Pointer to vertex data used by this edge group.
size_t triCount
Number triangles of this edge group.
size_t vertexSet
The vertex set index that contains the vertices for this edge group.
size_t triStart
Index to main triangles array, indicate the first triangle of this edge group, and all triangles of t...
EdgeList edges
The edges themselves.
bool degenerate
Indicates if this is a degenerate edge, ie it does not have 2 triangles.
Basic triangle structure.
size_t indexSet
The set of indexes this triangle came from (NB it is possible that the triangles on one side of an ed...
size_t vertexSet
The vertex set these vertices came from.
A vertex can actually represent several vertices in the final model, because vertices along texture s...
size_t indexSet
The vertex set this came from.
size_t vertexSet
Place of vertex in common vertex list.
size_t index
Location of point in euclidean space.
size_t originalIndex
The index set this was referenced (first) from.
A set of indexed geometry data.
const IndexData * indexData
The index data set this geometry data refers to.
RenderOperation::OperationType opType
The index information which describes the triangles.
size_t indexSet
The vertex data set this geometry data refers to.
Comparator for sorting geometries by vertex set.
bool operator()(const Geometry &a, const Geometry &b) const
Comparator for unique vertex list.
bool operator()(const Vector3 &a, const Vector3 &b) const
std::map< K, V, P, A > type
std::vector< T, A > type