237 lines
8.2 KiB
C++
237 lines
8.2 KiB
C++
/*
|
|
---------------------------------------------------------------------------
|
|
Open Asset Import Library (ASSIMP)
|
|
---------------------------------------------------------------------------
|
|
|
|
Copyright (c) 2006-2008, ASSIMP Development Team
|
|
|
|
All rights reserved.
|
|
|
|
Redistribution and use of this software in source and binary forms,
|
|
with or without modification, are permitted provided that the 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 Development Team.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
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
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
---------------------------------------------------------------------------
|
|
*/
|
|
|
|
/** @file Implementation of the post processing step to generate face
|
|
* normals for all imported faces.
|
|
*/
|
|
|
|
#include "AssimpPCH.h"
|
|
|
|
// internal headers
|
|
#include "GenVertexNormalsProcess.h"
|
|
#include "ProcessHelper.h"
|
|
|
|
using namespace Assimp;
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Constructor to be privately used by Importer
|
|
GenVertexNormalsProcess::GenVertexNormalsProcess()
|
|
{
|
|
this->configMaxAngle = AI_DEG_TO_RAD(175.f);
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Destructor, private as well
|
|
GenVertexNormalsProcess::~GenVertexNormalsProcess()
|
|
{
|
|
// nothing to do here
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Returns whether the processing step is present in the given flag field.
|
|
bool GenVertexNormalsProcess::IsActive( unsigned int pFlags) const
|
|
{
|
|
return (pFlags & aiProcess_GenSmoothNormals) != 0;
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Executes the post processing step on the given imported data.
|
|
void GenVertexNormalsProcess::SetupProperties(const Importer* pImp)
|
|
{
|
|
// get the current value of the property
|
|
this->configMaxAngle = pImp->GetPropertyFloat(AI_CONFIG_PP_GSN_MAX_SMOOTHING_ANGLE,175.f);
|
|
this->configMaxAngle = std::max(std::min(this->configMaxAngle,175.0f),0.0f);
|
|
this->configMaxAngle = AI_DEG_TO_RAD(this->configMaxAngle);
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Executes the post processing step on the given imported data.
|
|
void GenVertexNormalsProcess::Execute( aiScene* pScene)
|
|
{
|
|
DefaultLogger::get()->debug("GenVertexNormalsProcess begin");
|
|
|
|
bool bHas = false;
|
|
for( unsigned int a = 0; a < pScene->mNumMeshes; a++)
|
|
{
|
|
if(GenMeshVertexNormals( pScene->mMeshes[a],a))
|
|
bHas = true;
|
|
}
|
|
|
|
if (bHas)
|
|
{
|
|
DefaultLogger::get()->info("GenVertexNormalsProcess finished. "
|
|
"Vertex normals have been calculated");
|
|
}
|
|
else DefaultLogger::get()->debug("GenVertexNormalsProcess finished. "
|
|
"Normals are already there");
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Executes the post processing step on the given imported data.
|
|
bool GenVertexNormalsProcess::GenMeshVertexNormals (aiMesh* pMesh, unsigned int meshIndex)
|
|
{
|
|
if (NULL != pMesh->mNormals)
|
|
return false;
|
|
|
|
// If the mesh consists of lines and/or points but not of
|
|
// triangles or higher-order polygons the normal vectors
|
|
// are undefined.
|
|
if (!(pMesh->mPrimitiveTypes & (aiPrimitiveType_TRIANGLE | aiPrimitiveType_POLYGON)))
|
|
{
|
|
DefaultLogger::get()->info("Normal vectors are undefined for line and point meshes");
|
|
return false;
|
|
}
|
|
|
|
// allocate an array to hold the output normals
|
|
const float qnan = std::numeric_limits<float>::quiet_NaN();
|
|
pMesh->mNormals = new aiVector3D[pMesh->mNumVertices];
|
|
|
|
// compute per-face normals but store them per-vertex
|
|
for( unsigned int a = 0; a < pMesh->mNumFaces; a++)
|
|
{
|
|
const aiFace& face = pMesh->mFaces[a];
|
|
if (face.mNumIndices < 3)
|
|
{
|
|
// either a point or a line -> no normal vector
|
|
for (unsigned int i = 0;i < face.mNumIndices;++i)
|
|
pMesh->mNormals[face.mIndices[i]] = qnan;
|
|
continue;
|
|
}
|
|
|
|
aiVector3D* pV1 = &pMesh->mVertices[face.mIndices[0]];
|
|
aiVector3D* pV2 = &pMesh->mVertices[face.mIndices[1]];
|
|
aiVector3D* pV3 = &pMesh->mVertices[face.mIndices[face.mNumIndices-1]];
|
|
aiVector3D vNor = ((*pV2 - *pV1) ^ (*pV3 - *pV1)).Normalize();
|
|
|
|
for (unsigned int i = 0;i < face.mNumIndices;++i)
|
|
pMesh->mNormals[face.mIndices[i]] = vNor;
|
|
}
|
|
|
|
// set up a SpatialSort to quickly find all vertices close to a given position
|
|
// check whether we can reuse the SpatialSort of a previous step.
|
|
SpatialSort* vertexFinder = NULL;
|
|
SpatialSort _vertexFinder;
|
|
float posEpsilon;
|
|
const float epsilon = 1e-5f;
|
|
if (shared)
|
|
{
|
|
std::vector<std::pair<SpatialSort,float> >* avf;
|
|
shared->GetProperty(AI_SPP_SPATIAL_SORT,avf);
|
|
if (avf)
|
|
{
|
|
std::pair<SpatialSort,float>& blubb = avf->operator [] (meshIndex);
|
|
vertexFinder = &blubb.first;
|
|
posEpsilon = blubb.second;
|
|
}
|
|
}
|
|
if (!vertexFinder)
|
|
{
|
|
_vertexFinder.Fill(pMesh->mVertices, pMesh->mNumVertices, sizeof( aiVector3D));
|
|
vertexFinder = &_vertexFinder;
|
|
posEpsilon = ComputePositionEpsilon(pMesh);
|
|
}
|
|
std::vector<unsigned int> verticesFound;
|
|
aiVector3D* pcNew = new aiVector3D[pMesh->mNumVertices];
|
|
|
|
if (configMaxAngle >= AI_DEG_TO_RAD( 175.f ))
|
|
{
|
|
// there is no angle limit. Thus all vertices with positions close
|
|
// to each other will receive the same vertex normal. This allows us
|
|
// to optimize the whole algorithm a little bit ...
|
|
std::vector<bool> abHad(pMesh->mNumVertices,false);
|
|
|
|
for (unsigned int i = 0; i < pMesh->mNumVertices;++i)
|
|
{
|
|
if (abHad[i])continue;
|
|
|
|
// get all vertices that share this one ...
|
|
vertexFinder->FindPositions( pMesh->mVertices[i], posEpsilon, verticesFound);
|
|
|
|
aiVector3D pcNor;
|
|
for (unsigned int a = 0; a < verticesFound.size(); ++a)
|
|
{
|
|
const aiVector3D& v = pMesh->mNormals[verticesFound[a]];
|
|
if (is_not_qnan(v.x))pcNor += v;
|
|
}
|
|
|
|
pcNor.Normalize();
|
|
|
|
// write the smoothed normal back to all affected normals
|
|
for (unsigned int a = 0; a < verticesFound.size(); ++a)
|
|
{
|
|
register unsigned int vidx = verticesFound[a];
|
|
pcNew[vidx] = pcNor;
|
|
abHad[vidx] = true;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
const float fLimit = ::cos(configMaxAngle);
|
|
for (unsigned int i = 0; i < pMesh->mNumVertices;++i)
|
|
{
|
|
// get all vertices that share this one ...
|
|
vertexFinder->FindPositions( pMesh->mVertices[i] , posEpsilon, verticesFound);
|
|
|
|
aiVector3D pcNor;
|
|
for (unsigned int a = 0; a < verticesFound.size(); ++a)
|
|
{
|
|
const aiVector3D& v = pMesh->mNormals[verticesFound[a]];
|
|
|
|
// check whether the angle between the two normals is not too large
|
|
// HACK: if v.x is qnan the dot product will become qnan, too
|
|
// therefore the comparison against fLimit should be false
|
|
// in every case. Contact me if you disagree with this assumption
|
|
if (v * pMesh->mNormals[i] < fLimit)
|
|
continue;
|
|
|
|
pcNor += v;
|
|
}
|
|
pcNew[i] = pcNor.Normalize();
|
|
}
|
|
}
|
|
|
|
delete[] pMesh->mNormals;
|
|
pMesh->mNormals = pcNew;
|
|
|
|
return true;
|
|
}
|