Tidying up.

collada_edge/cross/conditioner.cpp

 /*
  * Copyright 2009, Google Inc.
  * All rights reserved.
  *
  * Redistribution and use 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 Google Inc. nor the names of its
  * contributors may be used to endorse or promote products derived from
  * this software without specific prior written permission.
  *
  * 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.
- */ 
+ */
 #include "precompile.h"
 
 #include "conditioner.h"
 
 #include <cstdio>
 #include <map>
 #include <vector>
 
 const float kEpsilon = 0.001f;
 static const float kPi = 3.14159265358979f;
@@ skipping 22 matching lines @@
     indices.push_back(i1);
     indices.push_back(i2);
   } else {
     pts.push_back(p2);
     pts.push_back(p1);
     indices.push_back(i2);
     indices.push_back(i1);
   }
 }
 
-// less than operator overload, necessary function for edge-triangle map.
+// Less than operator overload, necessary function for edge-triangle map.
 bool operator<(const Edge& left, const Edge& right) {
   // compare two edges by their actually coordinates.
   if (dist(left.pts[0], right.pts[0]) < kEpsilon) {
     if (fabs(left.pts[1].getX() - right.pts[1].getX()) < kEpsilon) {
       if (fabs(left.pts[1].getY() - right.pts[1].getY()) < kEpsilon) {
         return left.pts[1].getZ() < right.pts[1].getZ();
       }
       return left.pts[1].getY() < right.pts[1].getY();
     }
     return left.pts[1].getX() < right.pts[1].getX();
   } else {
     if (fabs(left.pts[0].getX() - right.pts[0].getX()) < kEpsilon) {
       if (fabs(left.pts[0].getY() - right.pts[0].getY()) < kEpsilon) {
         return left.pts[0].getZ() < right.pts[0].getZ();
       }
       return left.pts[0].getY() < right.pts[0].getY();
     }
     return left.pts[0].getX() < right.pts[0].getX();
   }
 }
 
-// go through triangles who share this edge. And check whether
+// Go through triangles who share this edge. And check whether
 // the max normal angle is larger than the threshold.
 void CheckSharpEdge(const Edge& shared_edge,
                     const std::vector<Triangle>& triangle_list,
                     std::vector<Edge>* sharp_edges, float threshold) {
   for (size_t i = 0; i < triangle_list.size(); i++)
     for (size_t j = i + 1; j < triangle_list.size(); j++) {
       Triangle t1 = triangle_list[i];
       Triangle t2 = triangle_list[j];
       int same_vertices_count = 0;
       // Same triangle might be stored twice to represent inner and
@@ skipping 26 matching lines @@
       Vector3 n2 = cross(v22, v23);
       float iAngle = acos(dot(n1, n2) / (length(n1) * length(n2)));
       iAngle = iAngle * 180 / kPi;
       if (iAngle >= threshold) {
         sharp_edges->push_back(shared_edge);
         return;
       }
     }
 }
 
-// insert edge-triangle pair to edge triangle map.
+// Insert edge-triangle pair to edge triangle map.
 void InsertEdgeTrianglePair(const Edge& edge, const Triangle& triangle,
                             std::map<Edge, std::vector<Triangle>>* et_map) {
   std::map<Edge, std::vector<Triangle>>::iterator iter1 =
     et_map->find(edge);
   if (iter1 == et_map->end()) {
     std::vector<Triangle> same_edge_triangle_list;
     same_edge_triangle_list.push_back(triangle);
     et_map->insert(make_pair(edge, same_edge_triangle_list));
   } else {
     iter1->second.push_back(triangle);
   }
 }
 
 NodeInstance* CreateInstanceTree(FCDSceneNode *node) {
   NodeInstance *instance = new NodeInstance(node);
   NodeInstance::NodeInstanceList &children = instance->children();
   for (size_t i = 0; i < node->GetChildrenCount(); ++i) {
     FCDSceneNode *child_node = node->GetChild(i);
     NodeInstance *child_instance = CreateInstanceTree(child_node);
     children.push_back(child_instance);
   }
   return instance;
 }
 
-// go through all polygons in geom_instance, and add all sharp edges
+// Go through all polygons in geom_instance, and add all sharp edges
 // as a new polygon in geom. And also, add material and effect based
 // on the given sharpEdgeColor option.
 void BuildSharpEdge(FCDocument* doc, FCDGeometryInstance* geom_instance,
                     const Options& options) {
   FCDGeometry* geom = static_cast<FCDGeometry*>(geom_instance->GetEntity());
   if (!(geom && geom->IsMesh()))
     return;
   FCDGeometryMesh* mesh = geom->GetMesh();
   FCDGeometryPolygonsTools::Triangulate(mesh);
   FCDGeometryPolygonsTools::GenerateUniqueIndices(mesh, NULL, NULL);
@@ skipping 182 matching lines @@
       }
     } else {
       printf("Error:  couldn't open the input file.\n");
     }
     doc->Release();
   } else {
     printf("Internal error:  Couldn't create FCollada document.\n");
   }
   FCollada::Release();
   return retval;
-}
+}
+