2015-05-19 03:48:29 +00:00
|
|
|
/*
|
|
|
|
Open Asset Import Library (assimp)
|
|
|
|
----------------------------------------------------------------------
|
|
|
|
|
2018-01-28 18:42:05 +00:00
|
|
|
Copyright (c) 2006-2018, assimp team
|
|
|
|
|
2017-05-09 17:57:36 +00:00
|
|
|
|
2015-05-19 03:48:29 +00:00
|
|
|
All rights reserved.
|
|
|
|
|
2015-05-19 03:52:10 +00:00
|
|
|
Redistribution and use of this software in source and binary forms,
|
|
|
|
with or without modification, are permitted provided that the
|
2015-05-19 03:48:29 +00:00
|
|
|
following conditions are met:
|
|
|
|
|
|
|
|
* Redistributions of source code must retain the above
|
|
|
|
copyright notice, this list of conditions and the
|
|
|
|
following disclaimer.
|
|
|
|
|
|
|
|
* Redistributions in binary form must reproduce the above
|
|
|
|
copyright notice, this list of conditions and the
|
|
|
|
following disclaimer in the documentation and/or other
|
|
|
|
materials provided with the distribution.
|
|
|
|
|
|
|
|
* Neither the name of the assimp team, nor the names of its
|
|
|
|
contributors may be used to endorse or promote products
|
|
|
|
derived from this software without specific prior
|
|
|
|
written permission of the assimp team.
|
|
|
|
|
2015-05-19 03:52:10 +00:00
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
2015-05-19 03:48:29 +00:00
|
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
2015-05-19 03:52:10 +00:00
|
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
2015-05-19 03:48:29 +00:00
|
|
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
2015-05-19 03:52:10 +00:00
|
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
2015-05-19 03:48:29 +00:00
|
|
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
2015-05-19 03:52:10 +00:00
|
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
2015-05-19 03:48:29 +00:00
|
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
----------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
|
|
|
|
/** @file OptimizeMeshes.h
|
2015-05-19 03:52:10 +00:00
|
|
|
* @brief Declares a post processing step to join meshes, if possible
|
2015-05-19 03:48:29 +00:00
|
|
|
*/
|
|
|
|
#ifndef AI_OPTIMIZEMESHESPROCESS_H_INC
|
|
|
|
#define AI_OPTIMIZEMESHESPROCESS_H_INC
|
|
|
|
|
|
|
|
#include "BaseProcess.h"
|
2016-06-06 20:04:29 +00:00
|
|
|
#include <assimp/types.h>
|
2015-05-19 03:48:29 +00:00
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
struct aiMesh;
|
|
|
|
struct aiNode;
|
|
|
|
class OptimizeMeshesProcessTest;
|
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
namespace Assimp {
|
2015-05-19 03:48:29 +00:00
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
/** @brief Postprocessing step to optimize mesh usage
|
|
|
|
*
|
|
|
|
* The implementation looks for meshes that could be joined and joins them.
|
|
|
|
* Usually this will reduce the number of drawcalls.
|
|
|
|
*
|
|
|
|
* @note Instanced meshes are currently not processed.
|
|
|
|
*/
|
|
|
|
class OptimizeMeshesProcess : public BaseProcess
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
OptimizeMeshesProcess();
|
|
|
|
~OptimizeMeshesProcess();
|
2015-05-19 03:48:29 +00:00
|
|
|
|
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
/** @brief Internal utility to store additional mesh info
|
|
|
|
*/
|
|
|
|
struct MeshInfo
|
|
|
|
{
|
|
|
|
MeshInfo()
|
|
|
|
: instance_cnt (0)
|
|
|
|
, vertex_format (0)
|
|
|
|
, output_id (0xffffffff)
|
|
|
|
{}
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Number of times this mesh is referenced
|
|
|
|
unsigned int instance_cnt;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Vertex format id
|
|
|
|
unsigned int vertex_format;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Output ID
|
|
|
|
unsigned int output_id;
|
|
|
|
};
|
2015-05-19 03:48:29 +00:00
|
|
|
|
|
|
|
public:
|
2015-05-19 03:57:13 +00:00
|
|
|
// -------------------------------------------------------------------
|
|
|
|
bool IsActive( unsigned int pFlags) const;
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
void Execute( aiScene* pScene);
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
void SetupProperties(const Importer* pImp);
|
|
|
|
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
/** @brief Specify whether you want meshes with different
|
|
|
|
* primitive types to be merged as well.
|
|
|
|
*
|
|
|
|
* IsActive() sets this property automatically to true if the
|
|
|
|
* aiProcess_SortByPType flag is found.
|
|
|
|
*/
|
|
|
|
void EnablePrimitiveTypeSorting(bool enable) {
|
|
|
|
pts = enable;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Getter
|
|
|
|
bool IsPrimitiveTypeSortingEnabled () const {
|
|
|
|
return pts;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
/** @brief Specify a maximum size of a single output mesh.
|
|
|
|
*
|
|
|
|
* If a single input mesh already exceeds this limit, it won't
|
|
|
|
* be split.
|
|
|
|
* @param verts Maximum number of vertices per mesh
|
|
|
|
* @param faces Maximum number of faces per mesh
|
|
|
|
*/
|
|
|
|
void SetPreferredMeshSizeLimit (unsigned int verts, unsigned int faces)
|
|
|
|
{
|
|
|
|
max_verts = verts;
|
|
|
|
max_faces = faces;
|
|
|
|
}
|
2015-05-19 03:48:29 +00:00
|
|
|
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
// -------------------------------------------------------------------
|
|
|
|
/** @brief Do the actual optimization on all meshes of this node
|
|
|
|
* @param pNode Node we're working with
|
|
|
|
*/
|
|
|
|
void ProcessNode( aiNode* pNode);
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
/** @brief Returns true if b can be joined with a
|
|
|
|
*
|
|
|
|
* @param verts Number of output verts up to now
|
|
|
|
* @param faces Number of output faces up to now
|
|
|
|
*/
|
|
|
|
bool CanJoin ( unsigned int a, unsigned int b,
|
|
|
|
unsigned int verts, unsigned int faces );
|
|
|
|
|
|
|
|
// -------------------------------------------------------------------
|
|
|
|
/** @brief Find instanced meshes, for the moment we're excluding
|
|
|
|
* them from all optimizations
|
|
|
|
*/
|
|
|
|
void FindInstancedMeshes (aiNode* pNode);
|
2015-05-19 03:48:29 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Scene we're working with
|
|
|
|
aiScene* mScene;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Per mesh info
|
|
|
|
std::vector<MeshInfo> meshes;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Output meshes
|
|
|
|
std::vector<aiMesh*> output;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! @see EnablePrimitiveTypeSorting
|
|
|
|
mutable bool pts;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! @see SetPreferredMeshSizeLimit
|
|
|
|
mutable unsigned int max_verts,max_faces;
|
2015-05-19 03:48:29 +00:00
|
|
|
|
2015-05-19 03:57:13 +00:00
|
|
|
//! Temporary storage
|
|
|
|
std::vector<aiMesh*> merge_list;
|
2015-05-19 03:48:29 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // end of namespace Assimp
|
|
|
|
|
|
|
|
#endif // AI_CALCTANGENTSPROCESS_H_INC
|