vrshoot

annotate libs/assimp/VertexTriangleAdjacency.cpp @ 0:b2f14e535253

find changesets by author, revision, files, or words in the commit message
initial commit
author John Tsiombikas <nuclear@member.fsf.org>
date Sat, 01 Feb 2014 19:58:19 +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 Implementation of the VertexTriangleAdjacency helper class
nuclear@0 43 */
nuclear@0 44
nuclear@0 45 #include "AssimpPCH.h"
nuclear@0 46
nuclear@0 47 // internal headers
nuclear@0 48 #include "VertexTriangleAdjacency.h"
nuclear@0 49
nuclear@0 50 using namespace Assimp;
nuclear@0 51
nuclear@0 52 // ------------------------------------------------------------------------------------------------
nuclear@0 53 VertexTriangleAdjacency::VertexTriangleAdjacency(aiFace *pcFaces,
nuclear@0 54 unsigned int iNumFaces,
nuclear@0 55 unsigned int iNumVertices /*= 0*/,
nuclear@0 56 bool bComputeNumTriangles /*= false*/)
nuclear@0 57 {
nuclear@0 58 // compute the number of referenced vertices if it wasn't specified by the caller
nuclear@0 59 const aiFace* const pcFaceEnd = pcFaces + iNumFaces;
nuclear@0 60 if (!iNumVertices) {
nuclear@0 61
nuclear@0 62 for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace) {
nuclear@0 63 ai_assert(3 == pcFace->mNumIndices);
nuclear@0 64 iNumVertices = std::max(iNumVertices,pcFace->mIndices[0]);
nuclear@0 65 iNumVertices = std::max(iNumVertices,pcFace->mIndices[1]);
nuclear@0 66 iNumVertices = std::max(iNumVertices,pcFace->mIndices[2]);
nuclear@0 67 }
nuclear@0 68 }
nuclear@0 69
nuclear@0 70 this->iNumVertices = iNumVertices;
nuclear@0 71
nuclear@0 72 unsigned int* pi;
nuclear@0 73
nuclear@0 74 // allocate storage
nuclear@0 75 if (bComputeNumTriangles) {
nuclear@0 76 pi = mLiveTriangles = new unsigned int[iNumVertices+1];
nuclear@0 77 memset(mLiveTriangles,0,sizeof(unsigned int)*(iNumVertices+1));
nuclear@0 78 mOffsetTable = new unsigned int[iNumVertices+2]+1;
nuclear@0 79 }
nuclear@0 80 else {
nuclear@0 81 pi = mOffsetTable = new unsigned int[iNumVertices+2]+1;
nuclear@0 82 memset(mOffsetTable,0,sizeof(unsigned int)*(iNumVertices+1));
nuclear@0 83 mLiveTriangles = NULL; // important, otherwise the d'tor would crash
nuclear@0 84 }
nuclear@0 85
nuclear@0 86 // get a pointer to the end of the buffer
nuclear@0 87 unsigned int* piEnd = pi+iNumVertices;
nuclear@0 88 *piEnd++ = 0u;
nuclear@0 89
nuclear@0 90 // first pass: compute the number of faces referencing each vertex
nuclear@0 91 for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace)
nuclear@0 92 {
nuclear@0 93 pi[pcFace->mIndices[0]]++;
nuclear@0 94 pi[pcFace->mIndices[1]]++;
nuclear@0 95 pi[pcFace->mIndices[2]]++;
nuclear@0 96 }
nuclear@0 97
nuclear@0 98 // second pass: compute the final offset table
nuclear@0 99 unsigned int iSum = 0;
nuclear@0 100 unsigned int* piCurOut = this->mOffsetTable;
nuclear@0 101 for (unsigned int* piCur = pi; piCur != piEnd;++piCur,++piCurOut) {
nuclear@0 102
nuclear@0 103 unsigned int iLastSum = iSum;
nuclear@0 104 iSum += *piCur;
nuclear@0 105 *piCurOut = iLastSum;
nuclear@0 106 }
nuclear@0 107 pi = this->mOffsetTable;
nuclear@0 108
nuclear@0 109 // third pass: compute the final table
nuclear@0 110 this->mAdjacencyTable = new unsigned int[iSum];
nuclear@0 111 iSum = 0;
nuclear@0 112 for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace,++iSum) {
nuclear@0 113
nuclear@0 114 unsigned int idx = pcFace->mIndices[0];
nuclear@0 115 mAdjacencyTable[pi[idx]++] = iSum;
nuclear@0 116
nuclear@0 117 idx = pcFace->mIndices[1];
nuclear@0 118 mAdjacencyTable[pi[idx]++] = iSum;
nuclear@0 119
nuclear@0 120 idx = pcFace->mIndices[2];
nuclear@0 121 mAdjacencyTable[pi[idx]++] = iSum;
nuclear@0 122 }
nuclear@0 123 // fourth pass: undo the offset computations made during the third pass
nuclear@0 124 // We could do this in a separate buffer, but this would be TIMES slower.
nuclear@0 125 --mOffsetTable;
nuclear@0 126 *mOffsetTable = 0u;
nuclear@0 127 }
nuclear@0 128 // ------------------------------------------------------------------------------------------------
nuclear@0 129 VertexTriangleAdjacency::~VertexTriangleAdjacency()
nuclear@0 130 {
nuclear@0 131 // delete allocated storage
nuclear@0 132 delete[] mOffsetTable;
nuclear@0 133 delete[] mAdjacencyTable;
nuclear@0 134 delete[] mLiveTriangles;
nuclear@0 135 }