vrshoot

annotate libs/assimp/OptimizeMeshes.h @ 3:c179c72369be

find changesets by author, revision, files, or words in the commit message
rename candy->vr
author John Tsiombikas <nuclear@member.fsf.org>
date Mon, 03 Feb 2014 08:52:13 +0200
parents
children
rev   line source
nuclear@0 1 /*
nuclear@0 2 Open Asset Import Library (assimp)
nuclear@0 3 ----------------------------------------------------------------------
nuclear@0 4
nuclear@0 5 Copyright (c) 2006-2012, assimp team
nuclear@0 6 All rights reserved.
nuclear@0 7
nuclear@0 8 Redistribution and use of this software in source and binary forms,
nuclear@0 9 with or without modification, are permitted provided that the
nuclear@0 10 following conditions are met:
nuclear@0 11
nuclear@0 12 * Redistributions of source code must retain the above
nuclear@0 13 copyright notice, this list of conditions and the
nuclear@0 14 following disclaimer.
nuclear@0 15
nuclear@0 16 * Redistributions in binary form must reproduce the above
nuclear@0 17 copyright notice, this list of conditions and the
nuclear@0 18 following disclaimer in the documentation and/or other
nuclear@0 19 materials provided with the distribution.
nuclear@0 20
nuclear@0 21 * Neither the name of the assimp team, nor the names of its
nuclear@0 22 contributors may be used to endorse or promote products
nuclear@0 23 derived from this software without specific prior
nuclear@0 24 written permission of the assimp team.
nuclear@0 25
nuclear@0 26 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
nuclear@0 27 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
nuclear@0 28 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
nuclear@0 29 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
nuclear@0 30 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
nuclear@0 31 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
nuclear@0 32 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
nuclear@0 33 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
nuclear@0 34 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
nuclear@0 35 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
nuclear@0 36 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
nuclear@0 37
nuclear@0 38 ----------------------------------------------------------------------
nuclear@0 39 */
nuclear@0 40
nuclear@0 41 /** @file OptimizeMeshes.h
nuclear@0 42 * @brief Declares a post processing step to join meshes, if possible
nuclear@0 43 */
nuclear@0 44 #ifndef AI_OPTIMIZEMESHESPROCESS_H_INC
nuclear@0 45 #define AI_OPTIMIZEMESHESPROCESS_H_INC
nuclear@0 46
nuclear@0 47 #include "BaseProcess.h"
nuclear@0 48 #include "assimp/types.h"
nuclear@0 49
nuclear@0 50 struct aiMesh;
nuclear@0 51 class OptimizeMeshesProcessTest;
nuclear@0 52 namespace Assimp {
nuclear@0 53
nuclear@0 54 // ---------------------------------------------------------------------------
nuclear@0 55 /** @brief Postprocessing step to optimize mesh usage
nuclear@0 56 *
nuclear@0 57 * The implementation looks for meshes that could be joined and joins them.
nuclear@0 58 * Usually this will reduce the number of drawcalls.
nuclear@0 59 *
nuclear@0 60 * @note Instanced meshes are currently not processed.
nuclear@0 61 */
nuclear@0 62 class OptimizeMeshesProcess : public BaseProcess
nuclear@0 63 {
nuclear@0 64 public:
nuclear@0 65
nuclear@0 66 OptimizeMeshesProcess();
nuclear@0 67 ~OptimizeMeshesProcess();
nuclear@0 68
nuclear@0 69
nuclear@0 70 /** @brief Internal utility to store additional mesh info
nuclear@0 71 */
nuclear@0 72 struct MeshInfo
nuclear@0 73 {
nuclear@0 74 MeshInfo()
nuclear@0 75 : instance_cnt (0)
nuclear@0 76 , vertex_format (0)
nuclear@0 77 , output_id (0xffffffff)
nuclear@0 78 {}
nuclear@0 79
nuclear@0 80 //! Number of times this mesh is referenced
nuclear@0 81 unsigned int instance_cnt;
nuclear@0 82
nuclear@0 83 //! Vertex format id
nuclear@0 84 unsigned int vertex_format;
nuclear@0 85
nuclear@0 86 //! Output ID
nuclear@0 87 unsigned int output_id;
nuclear@0 88 };
nuclear@0 89
nuclear@0 90 public:
nuclear@0 91 // -------------------------------------------------------------------
nuclear@0 92 bool IsActive( unsigned int pFlags) const;
nuclear@0 93
nuclear@0 94 // -------------------------------------------------------------------
nuclear@0 95 void Execute( aiScene* pScene);
nuclear@0 96
nuclear@0 97 // -------------------------------------------------------------------
nuclear@0 98 void SetupProperties(const Importer* pImp);
nuclear@0 99
nuclear@0 100
nuclear@0 101 // -------------------------------------------------------------------
nuclear@0 102 /** @brief Specify whether you want meshes with different
nuclear@0 103 * primitive types to be merged as well.
nuclear@0 104 *
nuclear@0 105 * IsActive() sets this property automatically to true if the
nuclear@0 106 * aiProcess_SortByPType flag is found.
nuclear@0 107 */
nuclear@0 108 void EnablePrimitiveTypeSorting(bool enable) {
nuclear@0 109 pts = enable;
nuclear@0 110 }
nuclear@0 111
nuclear@0 112 // Getter
nuclear@0 113 bool IsPrimitiveTypeSortingEnabled () const {
nuclear@0 114 return pts;
nuclear@0 115 }
nuclear@0 116
nuclear@0 117
nuclear@0 118 // -------------------------------------------------------------------
nuclear@0 119 /** @brief Specify a maximum size of a single output mesh.
nuclear@0 120 *
nuclear@0 121 * If a single input mesh already exceeds this limit, it won't
nuclear@0 122 * be split.
nuclear@0 123 * @param verts Maximum number of vertices per mesh
nuclear@0 124 * @param faces Maximum number of faces per mesh
nuclear@0 125 */
nuclear@0 126 void SetPreferredMeshSizeLimit (unsigned int verts, unsigned int faces)
nuclear@0 127 {
nuclear@0 128 max_verts = verts;
nuclear@0 129 max_faces = faces;
nuclear@0 130 }
nuclear@0 131
nuclear@0 132
nuclear@0 133 protected:
nuclear@0 134
nuclear@0 135 // -------------------------------------------------------------------
nuclear@0 136 /** @brief Do the actual optimization on all meshes of this node
nuclear@0 137 * @param pNode Node we're working with
nuclear@0 138 */
nuclear@0 139 void ProcessNode( aiNode* pNode);
nuclear@0 140
nuclear@0 141 // -------------------------------------------------------------------
nuclear@0 142 /** @brief Returns true if b can be joined with a
nuclear@0 143 *
nuclear@0 144 * @param verts Number of output verts up to now
nuclear@0 145 * @param faces Number of output faces up to now
nuclear@0 146 */
nuclear@0 147 bool CanJoin ( unsigned int a, unsigned int b,
nuclear@0 148 unsigned int verts, unsigned int faces );
nuclear@0 149
nuclear@0 150 // -------------------------------------------------------------------
nuclear@0 151 /** @brief Find instanced meshes, for the moment we're excluding
nuclear@0 152 * them from all optimizations
nuclear@0 153 */
nuclear@0 154 void FindInstancedMeshes (aiNode* pNode);
nuclear@0 155
nuclear@0 156 private:
nuclear@0 157
nuclear@0 158 //! Scene we're working with
nuclear@0 159 aiScene* mScene;
nuclear@0 160
nuclear@0 161 //! Per mesh info
nuclear@0 162 std::vector<MeshInfo> meshes;
nuclear@0 163
nuclear@0 164 //! Next output mesh
nuclear@0 165 aiMesh* mesh;
nuclear@0 166
nuclear@0 167 //! Output meshes
nuclear@0 168 std::vector<aiMesh*> output;
nuclear@0 169
nuclear@0 170 //! @see EnablePrimitiveTypeSorting
nuclear@0 171 mutable bool pts;
nuclear@0 172
nuclear@0 173 //! @see SetPreferredMeshSizeLimit
nuclear@0 174 mutable unsigned int max_verts,max_faces;
nuclear@0 175
nuclear@0 176 //! Temporary storage
nuclear@0 177 std::vector<aiMesh*> merge_list;
nuclear@0 178 };
nuclear@0 179
nuclear@0 180 } // end of namespace Assimp
nuclear@0 181
nuclear@0 182 #endif // AI_CALCTANGENTSPROCESS_H_INC