From 6395138b1f1cd143455ebc7336fc8a070e76468e Mon Sep 17 00:00:00 2001
From: mcallieri <marco.callieri@isti.cnr.it>
Date: Wed, 9 Feb 2011 14:42:30 +0000
Subject: [PATCH] added function for laplacian smoothing of normals on
 unstructured point clouds

---
 vcg/space/normal_extrapolation.h | 66 ++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)

diff --git a/vcg/space/normal_extrapolation.h b/vcg/space/normal_extrapolation.h
index 0d568ddd..d91b6d53 100644
--- a/vcg/space/normal_extrapolation.h
+++ b/vcg/space/normal_extrapolation.h
@@ -347,6 +347,72 @@ namespace vcg
 			}
 			if (callback!=NULL) (callback)(100, message);
 		};
+
+
+		static void SmoothNormalsUsingNeighbors(const VertexIterator &begin, const VertexIterator &end, const unsigned int k, bool usedistance, CallBackPos *callback=NULL)
+		{
+			BoundingBoxType dataset_bb;
+			for (VertexIterator iter=begin; iter!=end; iter++)
+				dataset_bb.Add(iter->P());
+			ScalarType max_distance = dataset_bb.Diag();
+
+			// Step 1: identify the tangent planes used to locally approximate the surface
+			int vertex_count = int( std::distance(begin, end) );
+			int step				 = int(vertex_count/100)-1;
+			int progress		 = 0;
+			int percentage;
+			char message[128];
+			sprintf(message, "Locating neighbors...");
+			
+			vcg::Octree< VertexType, ScalarType > octree_for_neighbors;
+			octree_for_neighbors.Set( begin, end );
+
+      std::vector< NormalType    > new_normals(vertex_count);
+
+			std::vector< VertexPointer > nearest_vertices;
+			std::vector< CoordType	 	 > nearest_points;
+			std::vector< ScalarType		 > distances;
+
+			for (VertexIterator iter=begin; iter!=end; iter++)
+			{
+				if (callback!=NULL && (++progress%step)==0 && (percentage=int((progress*100)/vertex_count))<100) (callback)(percentage, message);
+            VertPointDistanceFunctor vpdf;
+            DummyObjectMarker dom;
+				octree_for_neighbors.GetKClosest(vpdf, dom, k, iter->P(), max_distance, nearest_vertices, distances, nearest_points);
+
+				// for each vertex *iter, compute the normal as avarege of the k-nearest vertices of *iter
+        NormalType normal_accum(0.0, 0.0, 0.0);
+
+        ScalarType dist_max = -100.0;
+        if(usedistance)
+				  for (unsigned int n=0; n<k; n++)
+            {
+              if (distances[n] > dist_max)
+                dist_max = distances[n];
+            }
+
+				for (unsigned int n=0; n<k; n++)
+        {
+          if(usedistance)
+					  normal_accum += (nearest_vertices[n]->N() * distances[n]/dist_max);
+          else
+					  normal_accum += nearest_vertices[n]->N();
+        }
+
+        new_normals[iter-begin] = normal_accum;
+			}
+     
+			sprintf(message, "Assigning normals...");
+      progress = 0;
+			for (VertexIterator iter=begin; iter!=end; iter++)
+			{
+        if (callback!=NULL && (++progress%step)==0 && (percentage=int((progress*100)/vertex_count))<100) (callback)(percentage, message);
+        iter->N() = new_normals[iter-begin].Normalize();
+			}
+
+		};
+
+
 	};
 
 };//end of namespace vcg