1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/VertexTriangleAdjacency.cpp	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,135 @@
     1.4 +/*
     1.5 +---------------------------------------------------------------------------
     1.6 +Open Asset Import Library (assimp)
     1.7 +---------------------------------------------------------------------------
     1.8 +
     1.9 +Copyright (c) 2006-2012, assimp team
    1.10 +
    1.11 +All rights reserved.
    1.12 +
    1.13 +Redistribution and use of this software in source and binary forms, 
    1.14 +with or without modification, are permitted provided that the following 
    1.15 +conditions are met:
    1.16 +
    1.17 +* Redistributions of source code must retain the above
    1.18 +  copyright notice, this list of conditions and the
    1.19 +  following disclaimer.
    1.20 +
    1.21 +* Redistributions in binary form must reproduce the above
    1.22 +  copyright notice, this list of conditions and the
    1.23 +  following disclaimer in the documentation and/or other
    1.24 +  materials provided with the distribution.
    1.25 +
    1.26 +* Neither the name of the assimp team, nor the names of its
    1.27 +  contributors may be used to endorse or promote products
    1.28 +  derived from this software without specific prior
    1.29 +  written permission of the assimp team.
    1.30 +
    1.31 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
    1.32 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
    1.33 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    1.34 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
    1.35 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    1.36 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
    1.37 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    1.38 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
    1.39 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
    1.40 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
    1.41 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    1.42 +---------------------------------------------------------------------------
    1.43 +*/
    1.44 +
    1.45 +/** @file Implementation of the VertexTriangleAdjacency helper class
    1.46 + */
    1.47 +
    1.48 +#include "AssimpPCH.h"
    1.49 +
    1.50 +// internal headers
    1.51 +#include "VertexTriangleAdjacency.h"
    1.52 +
    1.53 +using namespace Assimp;
    1.54 +
    1.55 +// ------------------------------------------------------------------------------------------------
    1.56 +VertexTriangleAdjacency::VertexTriangleAdjacency(aiFace *pcFaces,
    1.57 +	unsigned int iNumFaces,
    1.58 +	unsigned int iNumVertices /*= 0*/,
    1.59 +	bool bComputeNumTriangles /*= false*/)
    1.60 +{
    1.61 +	// compute the number of referenced vertices if it wasn't specified by the caller
    1.62 +	const aiFace* const pcFaceEnd = pcFaces + iNumFaces;
    1.63 +	if (!iNumVertices)	{
    1.64 +
    1.65 +		for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace)	{
    1.66 +			ai_assert(3 == pcFace->mNumIndices);
    1.67 +			iNumVertices = std::max(iNumVertices,pcFace->mIndices[0]);
    1.68 +			iNumVertices = std::max(iNumVertices,pcFace->mIndices[1]);
    1.69 +			iNumVertices = std::max(iNumVertices,pcFace->mIndices[2]);
    1.70 +		}
    1.71 +	}
    1.72 +
    1.73 +	this->iNumVertices = iNumVertices;
    1.74 +
    1.75 +	unsigned int* pi;
    1.76 +
    1.77 +	// allocate storage
    1.78 +	if (bComputeNumTriangles)	{
    1.79 +		pi = mLiveTriangles = new unsigned int[iNumVertices+1];
    1.80 +		memset(mLiveTriangles,0,sizeof(unsigned int)*(iNumVertices+1));
    1.81 +		mOffsetTable = new unsigned int[iNumVertices+2]+1;
    1.82 +	}
    1.83 +	else {
    1.84 +		pi = mOffsetTable = new unsigned int[iNumVertices+2]+1;
    1.85 +		memset(mOffsetTable,0,sizeof(unsigned int)*(iNumVertices+1));
    1.86 +		mLiveTriangles = NULL; // important, otherwise the d'tor would crash
    1.87 +	}
    1.88 +
    1.89 +	// get a pointer to the end of the buffer
    1.90 +	unsigned int* piEnd = pi+iNumVertices;
    1.91 +	*piEnd++ = 0u;
    1.92 +
    1.93 +	// first pass: compute the number of faces referencing each vertex
    1.94 +	for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace)
    1.95 +	{
    1.96 +		pi[pcFace->mIndices[0]]++;	
    1.97 +		pi[pcFace->mIndices[1]]++;	
    1.98 +		pi[pcFace->mIndices[2]]++;	
    1.99 +	}
   1.100 +
   1.101 +	// second pass: compute the final offset table
   1.102 +	unsigned int iSum = 0;
   1.103 +	unsigned int* piCurOut = this->mOffsetTable;
   1.104 +	for (unsigned int* piCur = pi; piCur != piEnd;++piCur,++piCurOut)	{
   1.105 +
   1.106 +		unsigned int iLastSum = iSum;
   1.107 +		iSum += *piCur; 
   1.108 +		*piCurOut = iLastSum;
   1.109 +	}
   1.110 +	pi = this->mOffsetTable;
   1.111 +
   1.112 +	// third pass: compute the final table
   1.113 +	this->mAdjacencyTable = new unsigned int[iSum];
   1.114 +	iSum = 0;
   1.115 +	for (aiFace* pcFace = pcFaces; pcFace != pcFaceEnd; ++pcFace,++iSum)	{
   1.116 +
   1.117 +		unsigned int idx = pcFace->mIndices[0];
   1.118 +		mAdjacencyTable[pi[idx]++] = iSum;
   1.119 +
   1.120 +		idx = pcFace->mIndices[1];
   1.121 +		mAdjacencyTable[pi[idx]++] = iSum;
   1.122 +
   1.123 +		idx = pcFace->mIndices[2];
   1.124 +		mAdjacencyTable[pi[idx]++] = iSum;
   1.125 +	}
   1.126 +	// fourth pass: undo the offset computations made during the third pass
   1.127 +	// We could do this in a separate buffer, but this would be TIMES slower.
   1.128 +	--mOffsetTable;
   1.129 +	*mOffsetTable = 0u;
   1.130 +}
   1.131 +// ------------------------------------------------------------------------------------------------
   1.132 +VertexTriangleAdjacency::~VertexTriangleAdjacency()
   1.133 +{
   1.134 +	// delete allocated storage
   1.135 +	delete[] mOffsetTable;
   1.136 +	delete[] mAdjacencyTable;
   1.137 +	delete[] mLiveTriangles;
   1.138 +}