vrshoot

annotate libs/assimp/SmoothingGroups.inl @ 2:334d17aed7de

find changesets by author, revision, files, or words in the commit message
visual studio project files
author John Tsiombikas <nuclear@member.fsf.org>
date Sun, 02 Feb 2014 18:36:38 +0200
parents
children
rev   line source
nuclear@0 1 /*
nuclear@0 2 ---------------------------------------------------------------------------
nuclear@0 3 Open Asset Import Library (assimp)
nuclear@0 4 ---------------------------------------------------------------------------
nuclear@0 5
nuclear@0 6 Copyright (c) 2006-2012, assimp team
nuclear@0 7
nuclear@0 8 All rights reserved.
nuclear@0 9
nuclear@0 10 Redistribution and use of this software in source and binary forms,
nuclear@0 11 with or without modification, are permitted provided that the following
nuclear@0 12 conditions are met:
nuclear@0 13
nuclear@0 14 * Redistributions of source code must retain the above
nuclear@0 15 copyright notice, this list of conditions and the
nuclear@0 16 following disclaimer.
nuclear@0 17
nuclear@0 18 * Redistributions in binary form must reproduce the above
nuclear@0 19 copyright notice, this list of conditions and the
nuclear@0 20 following disclaimer in the documentation and/or other
nuclear@0 21 materials provided with the distribution.
nuclear@0 22
nuclear@0 23 * Neither the name of the assimp team, nor the names of its
nuclear@0 24 contributors may be used to endorse or promote products
nuclear@0 25 derived from this software without specific prior
nuclear@0 26 written permission of the assimp team.
nuclear@0 27
nuclear@0 28 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
nuclear@0 29 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
nuclear@0 30 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
nuclear@0 31 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
nuclear@0 32 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
nuclear@0 33 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
nuclear@0 34 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
nuclear@0 35 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
nuclear@0 36 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
nuclear@0 37 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
nuclear@0 38 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
nuclear@0 39 ---------------------------------------------------------------------------
nuclear@0 40 */
nuclear@0 41
nuclear@0 42 /** @file Generation of normal vectors basing on smoothing groups */
nuclear@0 43
nuclear@0 44 #ifndef AI_SMOOTHINGGROUPS_INL_INCLUDED
nuclear@0 45 #define AI_SMOOTHINGGROUPS_INL_INCLUDED
nuclear@0 46
nuclear@0 47 // internal headers
nuclear@0 48 #include "SGSpatialSort.h"
nuclear@0 49
nuclear@0 50 // CRT header
nuclear@0 51 #include <algorithm>
nuclear@0 52
nuclear@0 53 using namespace Assimp;
nuclear@0 54
nuclear@0 55 // ------------------------------------------------------------------------------------------------
nuclear@0 56 template <class T>
nuclear@0 57 void ComputeNormalsWithSmoothingsGroups(MeshWithSmoothingGroups<T>& sMesh)
nuclear@0 58 {
nuclear@0 59 // First generate face normals
nuclear@0 60 sMesh.mNormals.resize(sMesh.mPositions.size(),aiVector3D());
nuclear@0 61 for( unsigned int a = 0; a < sMesh.mFaces.size(); a++)
nuclear@0 62 {
nuclear@0 63 T& face = sMesh.mFaces[a];
nuclear@0 64
nuclear@0 65 aiVector3D* pV1 = &sMesh.mPositions[face.mIndices[0]];
nuclear@0 66 aiVector3D* pV2 = &sMesh.mPositions[face.mIndices[1]];
nuclear@0 67 aiVector3D* pV3 = &sMesh.mPositions[face.mIndices[2]];
nuclear@0 68
nuclear@0 69 aiVector3D pDelta1 = *pV2 - *pV1;
nuclear@0 70 aiVector3D pDelta2 = *pV3 - *pV1;
nuclear@0 71 aiVector3D vNor = pDelta1 ^ pDelta2;
nuclear@0 72
nuclear@0 73 for (unsigned int c = 0; c < 3;++c)
nuclear@0 74 sMesh.mNormals[face.mIndices[c]] = vNor;
nuclear@0 75 }
nuclear@0 76
nuclear@0 77 // calculate the position bounds so we have a reliable epsilon to check position differences against
nuclear@0 78 aiVector3D minVec( 1e10f, 1e10f, 1e10f), maxVec( -1e10f, -1e10f, -1e10f);
nuclear@0 79 for( unsigned int a = 0; a < sMesh.mPositions.size(); a++)
nuclear@0 80 {
nuclear@0 81 minVec.x = std::min( minVec.x, sMesh.mPositions[a].x);
nuclear@0 82 minVec.y = std::min( minVec.y, sMesh.mPositions[a].y);
nuclear@0 83 minVec.z = std::min( minVec.z, sMesh.mPositions[a].z);
nuclear@0 84 maxVec.x = std::max( maxVec.x, sMesh.mPositions[a].x);
nuclear@0 85 maxVec.y = std::max( maxVec.y, sMesh.mPositions[a].y);
nuclear@0 86 maxVec.z = std::max( maxVec.z, sMesh.mPositions[a].z);
nuclear@0 87 }
nuclear@0 88 const float posEpsilon = (maxVec - minVec).Length() * 1e-5f;
nuclear@0 89 std::vector<aiVector3D> avNormals;
nuclear@0 90 avNormals.resize(sMesh.mNormals.size());
nuclear@0 91
nuclear@0 92 // now generate the spatial sort tree
nuclear@0 93 SGSpatialSort sSort;
nuclear@0 94 for( typename std::vector<T>::iterator i = sMesh.mFaces.begin();
nuclear@0 95 i != sMesh.mFaces.end();++i)
nuclear@0 96 {
nuclear@0 97 for (unsigned int c = 0; c < 3;++c)
nuclear@0 98 sSort.Add(sMesh.mPositions[(*i).mIndices[c]],(*i).mIndices[c],(*i).iSmoothGroup);
nuclear@0 99 }
nuclear@0 100 sSort.Prepare();
nuclear@0 101
nuclear@0 102 std::vector<bool> vertexDone(sMesh.mPositions.size(),false);
nuclear@0 103 for( typename std::vector<T>::iterator i = sMesh.mFaces.begin();
nuclear@0 104 i != sMesh.mFaces.end();++i)
nuclear@0 105 {
nuclear@0 106 std::vector<unsigned int> poResult;
nuclear@0 107 for (unsigned int c = 0; c < 3;++c)
nuclear@0 108 {
nuclear@0 109 register unsigned int idx = (*i).mIndices[c];
nuclear@0 110 if (vertexDone[idx])continue;
nuclear@0 111
nuclear@0 112 sSort.FindPositions(sMesh.mPositions[idx],(*i).iSmoothGroup,
nuclear@0 113 posEpsilon,poResult);
nuclear@0 114
nuclear@0 115 aiVector3D vNormals;
nuclear@0 116 for (std::vector<unsigned int>::const_iterator
nuclear@0 117 a = poResult.begin();
nuclear@0 118 a != poResult.end();++a)
nuclear@0 119 {
nuclear@0 120 vNormals += sMesh.mNormals[(*a)];
nuclear@0 121 }
nuclear@0 122 vNormals.Normalize();
nuclear@0 123
nuclear@0 124 // write back into all affected normals
nuclear@0 125 for (std::vector<unsigned int>::const_iterator
nuclear@0 126 a = poResult.begin();
nuclear@0 127 a != poResult.end();++a)
nuclear@0 128 {
nuclear@0 129 idx = *a;
nuclear@0 130 avNormals [idx] = vNormals;
nuclear@0 131 vertexDone[idx] = true;
nuclear@0 132 }
nuclear@0 133 }
nuclear@0 134 }
nuclear@0 135 sMesh.mNormals = avNormals;
nuclear@0 136 }
nuclear@0 137
nuclear@0 138 #endif // !! AI_SMOOTHINGGROUPS_INL_INCLUDED