diff --git a/vcg/complex/trimesh/update/selection.h b/vcg/complex/trimesh/update/selection.h
new file mode 100644
index 00000000..455586d3
--- /dev/null
+++ b/vcg/complex/trimesh/update/selection.h
@@ -0,0 +1,215 @@
+/****************************************************************************
+* VCGLib                                                            o o     *
+* Visual and Computer Graphics Library                            o     o   *
+*                                                                _   O  _   *
+* Copyright(C) 2004                                                \/)\/    *
+* Visual Computing Lab                                            /\/|      *
+* ISTI - Italian National Research Council                           |      *
+*                                                                    \      *
+* All rights reserved.                                                      *
+*                                                                           *
+* This program is free software; you can redistribute it and/or modify      *   
+* it under the terms of the GNU General Public License as published by      *
+* the Free Software Foundation; either version 2 of the License, or         *
+* (at your option) any later version.                                       *
+*                                                                           *
+* This program is distributed in the hope that it will be useful,           *
+* but WITHOUT ANY WARRANTY; without even the implied warranty of            *
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the             *
+* GNU General Public License (http://www.gnu.org/licenses/gpl.txt)          *
+* for more details.                                                         *
+*                                                                           *
+****************************************************************************/
+/****************************************************************************
+  History
+
+$Log: not supported by cvs2svn $
+****************************************************************************/
+#ifndef __VCG_TRI_UPDATE_SELECTION
+#define __VCG_TRI_UPDATE_SELECTION
+
+namespace vcg {
+namespace tri {
+
+/** \addtogroup trimesh */
+/*@{*/
+
+/// Management, updating and computation of per-vertex and per-face normals.
+/// This class is used to compute or update the normals that can be stored in the vertex or face component of a mesh.
+template <class ComputeMeshType>
+class UpdateSelection
+{
+
+public:
+typedef ComputeMeshType MeshType; 
+typedef typename MeshType::VertexType     VertexType;
+typedef typename MeshType::VertexPointer  VertexPointer;
+typedef typename MeshType::VertexIterator VertexIterator;
+typedef typename MeshType::FaceType       FaceType;
+typedef typename MeshType::FacePointer    FacePointer;
+typedef typename MeshType::FaceIterator   FaceIterator;
+
+/// 
+static size_t AllVertex(MeshType &m)
+{
+	VertexIterator vi;
+	for(vi = m.vert.begin(); vi != m.vert.end(); ++vi)
+		if( !(*vi).IsD() )	(*vi).SetS();
+  return m.vn;
+}
+  
+static size_t AllFace(MeshType &m)
+{
+	FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+    if( !(*fi).IsD() )	(*fi).SetS();
+  return m.fn;  
+}
+
+static size_t ClearVertex(MeshType &m)
+{
+	VertexIterator vi;
+	for(vi = m.vert.begin(); vi != m.vert.end(); ++vi)
+		if( !(*vi).IsD() )	(*vi).ClearS();
+  return 0;
+}
+
+static size_t ClearFace(MeshType &m)
+{
+	FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+		if( !(*fi).IsD() )	(*fi).ClearS();
+  return 0;
+}
+
+static void Clear(MeshType &m)
+{
+  ClearVertex(m);
+  ClearFace(m);
+}
+
+static size_t CountFace(MeshType &m)
+{
+  size_t selCnt=0;
+	FaceIterator fi;
+  for(fi=m.face.begin();fi!=m.face.end();++fi)
+    if(!(*fi).IsD() && (*fi).IsS()) ++selCnt;
+  return selCnt;
+}
+
+static size_t CountVertex(MeshType &m)
+{
+  size_t selCnt=0;
+	VertexIterator vi;
+  for(vi=m.vert.begin();vi!=m.vert.end();++vi)
+    if(!(*vi).IsD() && (*vi).IsS()) ++selCnt;
+  return selCnt;
+}
+
+static size_t InvertFace(MeshType &m)
+{
+  size_t selCnt=0;
+	FaceIterator fi;
+  for(fi=m.face.begin();fi!=m.face.end();++fi)
+      if(!(*fi).IsD()) 
+      {
+        if((*fi).IsS()) (*fi).ClearS(); 
+        else {
+          (*fi).SetS(); 
+          ++selCnt;
+        }
+      }
+  return selCnt;
+} 
+
+static size_t InvertVertex(MeshType &m)
+{
+  size_t selCnt=0;
+	VertexIterator vi;
+  for(vi=m.vert.begin();vi!=m.vert.end();++vi)
+      if(!(*vi).IsD()) 
+      {
+        if((*vi).IsS()) (*vi).ClearS(); 
+        else {
+          (*vi).SetS(); 
+          ++selCnt;
+        }
+      }
+  return selCnt;
+} 
+
+// Select all the vertices that are touched by at least a single selected faces
+static size_t VertexFromFaceLoose(MeshType &m)
+{
+  size_t selCnt=0;
+	ClearVertex(m);
+  FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+		if( !(*fi).IsD() && (*fi).IsS())	
+    {
+      if( !(*fi).V(0)->IsS()) { (*fi).V(0)->SetS(); ++selCnt; }
+      if( !(*fi).V(1)->IsS()) { (*fi).V(1)->SetS(); ++selCnt; }
+      if( !(*fi).V(2)->IsS()) { (*fi).V(2)->SetS(); ++selCnt; }
+    }
+  return selCnt;
+}
+
+// Select ONLY the vertices that are touched ONLY by selected faces
+static size_t VertexFromFaceStrict(MeshType &m)
+{
+  size_t selCnt=0;
+	AllVertex(m);
+  FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+		if( !(*fi).IsD() && !(*fi).IsS())	
+    {
+     (*fi).V(0)->ClearS(); 
+     (*fi).V(1)->ClearS(); 
+     (*fi).V(2)->ClearS(); 
+    }
+  return CountVertex(m);
+}
+
+// Select ONLY the faces with ALL the vertices selected 
+static size_t FaceFromVertexStrict(MeshType &m)
+{
+  size_t selCnt=0;
+	ClearFace(m);
+  FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+		if( !(*fi).IsD())	
+    {
+      if((*fi).V(0)->IsS() && (*fi).V(1)->IsS() && (*fi).V(2)->IsS())
+      { 
+        (*fi).SetS();
+        ++selCnt;
+      }
+    }
+  return selCnt;
+}
+
+static size_t FaceFromVertexLoose(MeshType &m)
+{
+  size_t selCnt=0;
+	ClearFace(m);
+  FaceIterator fi;
+	for(fi = m.face.begin(); fi != m.face.end(); ++fi)
+		if( !(*fi).IsD() && !(*fi).IsS())	
+    {
+      if((*fi).V(0)->IsS() || (*fi).V(1)->IsS() || (*fi).V(2)->IsS())
+      { 
+        (*fi).SetS();
+        ++selCnt;
+      }
+    }
+  return selCnt;
+}
+
+
+}; // end class
+
+}	// End namespace
+}	// End namespace
+
+
+#endif