浏览代码

Check for null

Doron Adler 7 年之前
父节点
当前提交
323d59c7aa
共有 1 个文件被更改,包括 5 次插入3 次删除
  1. 5 3
      code/TriangulateProcess.cpp

+ 5 - 3
code/TriangulateProcess.cpp

@@ -105,8 +105,10 @@ void TriangulateProcess::Execute( aiScene* pScene)
     bool bHas = false;
     for( unsigned int a = 0; a < pScene->mNumMeshes; a++)
     {
-        if ( TriangulateMesh( pScene->mMeshes[ a ] ) ) {
-            bHas = true;
+        if (pScene->mMeshes[ a ]) {
+            if ( TriangulateMesh( pScene->mMeshes[ a ] ) ) {
+                bHas = true;
+            }
         }
     }
     if ( bHas ) {
@@ -286,7 +288,7 @@ bool TriangulateProcess::TriangulateMesh( aiMesh* pMesh)
             // We project it onto a plane to get a 2d triangle.
 
             // Collect all vertices of of the polygon.
-            for (tmp = 0; tmp < max; ++tmp) {
+            for (tmp = 0; tmp < MIN(max,max_out+2); ++tmp) {
                 temp_verts3d[tmp] = verts[idx[tmp]];
             }