Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

VertexTriangleAdjacency.h 4.4 KiB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /*
  2. Open Asset Import Library (assimp)
  3. ----------------------------------------------------------------------
  4. Copyright (c) 2006-2012, assimp team
  5. All rights reserved.
  6. Redistribution and use of this software in source and binary forms,
  7. with or without modification, are permitted provided that the
  8. following conditions are met:
  9. * Redistributions of source code must retain the above
  10. copyright notice, this list of conditions and the
  11. following disclaimer.
  12. * Redistributions in binary form must reproduce the above
  13. copyright notice, this list of conditions and the
  14. following disclaimer in the documentation and/or other
  15. materials provided with the distribution.
  16. * Neither the name of the assimp team, nor the names of its
  17. contributors may be used to endorse or promote products
  18. derived from this software without specific prior
  19. written permission of the assimp team.
  20. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  21. "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  22. LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  23. A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  24. OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  25. SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  26. LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  27. DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  28. THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  29. (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  30. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31. ----------------------------------------------------------------------
  32. */
  33. /** @file Defines a helper class to compute a vertex-triangle adjacency map */
  34. #ifndef AI_VTADJACENCY_H_INC
  35. #define AI_VTADJACENCY_H_INC
  36. #include "BaseProcess.h"
  37. #include "../include/assimp/types.h"
  38. #include "../include/assimp/ai_assert.h"
  39. struct aiMesh;
  40. namespace Assimp {
  41. // --------------------------------------------------------------------------------------------
  42. /** @brief The VertexTriangleAdjacency class computes a vertex-triangle
  43. * adjacency map from a given index buffer.
  44. *
  45. * @note Although it is called #VertexTriangleAdjacency, the current version does also
  46. * support arbitrary polygons. */
  47. // --------------------------------------------------------------------------------------------
  48. class ASSIMP_API VertexTriangleAdjacency
  49. {
  50. public:
  51. // ----------------------------------------------------------------------------
  52. /** @brief Construction from an existing index buffer
  53. * @param pcFaces Index buffer
  54. * @param iNumFaces Number of faces in the buffer
  55. * @param iNumVertices Number of referenced vertices. This value
  56. * is computed automatically if 0 is specified.
  57. * @param bComputeNumTriangles If you want the class to compute
  58. * a list containing the number of referenced triangles per vertex
  59. * per vertex - pass true. */
  60. VertexTriangleAdjacency(aiFace* pcFaces,unsigned int iNumFaces,
  61. unsigned int iNumVertices = 0,
  62. bool bComputeNumTriangles = true);
  63. // ----------------------------------------------------------------------------
  64. /** @brief Destructor */
  65. ~VertexTriangleAdjacency();
  66. public:
  67. // ----------------------------------------------------------------------------
  68. /** @brief Get all triangles adjacent to a vertex
  69. * @param iVertIndex Index of the vertex
  70. * @return A pointer to the adjacency list. */
  71. unsigned int* GetAdjacentTriangles(unsigned int iVertIndex) const
  72. {
  73. ai_assert(iVertIndex < iNumVertices);
  74. return &mAdjacencyTable[ mOffsetTable[iVertIndex]];
  75. }
  76. // ----------------------------------------------------------------------------
  77. /** @brief Get the number of triangles that are referenced by
  78. * a vertex. This function returns a reference that can be modified
  79. * @param iVertIndex Index of the vertex
  80. * @return Number of referenced triangles */
  81. unsigned int& GetNumTrianglesPtr(unsigned int iVertIndex)
  82. {
  83. ai_assert(iVertIndex < iNumVertices && NULL != mLiveTriangles);
  84. return mLiveTriangles[iVertIndex];
  85. }
  86. public:
  87. //! Offset table
  88. unsigned int* mOffsetTable;
  89. //! Adjacency table
  90. unsigned int* mAdjacencyTable;
  91. //! Table containing the number of referenced triangles per vertex
  92. unsigned int* mLiveTriangles;
  93. //! Debug: Number of referenced vertices
  94. unsigned int iNumVertices;
  95. };
  96. }
  97. #endif // !! AI_VTADJACENCY_H_INC