1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/VertexTriangleAdjacency.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,124 @@
     1.4 +/*
     1.5 +Open Asset Import Library (assimp)
     1.6 +----------------------------------------------------------------------
     1.7 +
     1.8 +Copyright (c) 2006-2012, assimp team
     1.9 +All rights reserved.
    1.10 +
    1.11 +Redistribution and use of this software in source and binary forms, 
    1.12 +with or without modification, are permitted provided that the 
    1.13 +following conditions are met:
    1.14 +
    1.15 +* Redistributions of source code must retain the above
    1.16 +  copyright notice, this list of conditions and the
    1.17 +  following disclaimer.
    1.18 +
    1.19 +* Redistributions in binary form must reproduce the above
    1.20 +  copyright notice, this list of conditions and the
    1.21 +  following disclaimer in the documentation and/or other
    1.22 +  materials provided with the distribution.
    1.23 +
    1.24 +* Neither the name of the assimp team, nor the names of its
    1.25 +  contributors may be used to endorse or promote products
    1.26 +  derived from this software without specific prior
    1.27 +  written permission of the assimp team.
    1.28 +
    1.29 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
    1.30 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
    1.31 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    1.32 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
    1.33 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    1.34 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
    1.35 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    1.36 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
    1.37 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
    1.38 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
    1.39 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    1.40 +
    1.41 +----------------------------------------------------------------------
    1.42 +*/
    1.43 +
    1.44 +/** @file Defines a helper class to compute a vertex-triangle adjacency map */
    1.45 +#ifndef AI_VTADJACENCY_H_INC
    1.46 +#define AI_VTADJACENCY_H_INC
    1.47 +
    1.48 +#include "BaseProcess.h"
    1.49 +#include "assimp/types.h"
    1.50 +#include "assimp/ai_assert.h"
    1.51 +
    1.52 +struct aiMesh;
    1.53 +namespace Assimp	{
    1.54 +
    1.55 +// --------------------------------------------------------------------------------------------
    1.56 +/** @brief The VertexTriangleAdjacency class computes a vertex-triangle
    1.57 + *  adjacency map from a given index buffer.
    1.58 + *
    1.59 + *  @note Although it is called #VertexTriangleAdjacency, the current version does also
    1.60 + *    support arbitrary polygons. */
    1.61 +// --------------------------------------------------------------------------------------------
    1.62 +class VertexTriangleAdjacency
    1.63 +{
    1.64 +public:
    1.65 +
    1.66 +	// ----------------------------------------------------------------------------
    1.67 +	/** @brief Construction from an existing index buffer
    1.68 +	 *  @param pcFaces Index buffer
    1.69 +	 *  @param iNumFaces Number of faces in the buffer
    1.70 +	 *  @param iNumVertices Number of referenced vertices. This value
    1.71 +	 *    is computed automatically if 0 is specified.
    1.72 +	 *  @param bComputeNumTriangles If you want the class to compute
    1.73 +	 *    a list containing the number of referenced triangles per vertex
    1.74 +	 *    per vertex - pass true.  */
    1.75 +	VertexTriangleAdjacency(aiFace* pcFaces,unsigned int iNumFaces,
    1.76 +		unsigned int iNumVertices = 0,
    1.77 +		bool bComputeNumTriangles = true);
    1.78 +
    1.79 +
    1.80 +	// ----------------------------------------------------------------------------
    1.81 +	/** @brief Destructor */
    1.82 +	~VertexTriangleAdjacency();
    1.83 +
    1.84 +
    1.85 +public:
    1.86 +
    1.87 +	// ----------------------------------------------------------------------------
    1.88 +	/** @brief Get all triangles adjacent to a vertex
    1.89 +	 *  @param iVertIndex Index of the vertex
    1.90 +	 *  @return A pointer to the adjacency list. */
    1.91 +	unsigned int* GetAdjacentTriangles(unsigned int iVertIndex) const
    1.92 +	{
    1.93 +		ai_assert(iVertIndex < iNumVertices);
    1.94 +		return &mAdjacencyTable[ mOffsetTable[iVertIndex]];
    1.95 +	}
    1.96 +
    1.97 +
    1.98 +	// ----------------------------------------------------------------------------
    1.99 +	/** @brief Get the number of triangles that are referenced by
   1.100 +	 *    a vertex. This function returns a reference that can be modified
   1.101 +	 *  @param iVertIndex Index of the vertex
   1.102 +	 *  @return Number of referenced triangles */
   1.103 +	unsigned int& GetNumTrianglesPtr(unsigned int iVertIndex)
   1.104 +	{
   1.105 +		ai_assert(iVertIndex < iNumVertices && NULL != mLiveTriangles);
   1.106 +		return mLiveTriangles[iVertIndex];
   1.107 +	}
   1.108 +
   1.109 +
   1.110 +public:
   1.111 +
   1.112 +	//! Offset table
   1.113 +	unsigned int* mOffsetTable;
   1.114 +
   1.115 +	//! Adjacency table
   1.116 +	unsigned int* mAdjacencyTable;
   1.117 +
   1.118 +	//! Table containing the number of referenced triangles per vertex
   1.119 +	unsigned int* mLiveTriangles;
   1.120 +
   1.121 +	//! Debug: Number of referenced vertices
   1.122 +	unsigned int iNumVertices;
   1.123 +
   1.124 +};
   1.125 +}
   1.126 +
   1.127 +#endif // !! AI_VTADJACENCY_H_INC