From 9af7eb8158034dbb0b1ec816b82aa9f1585fde36 Mon Sep 17 00:00:00 2001 From: Luigi Malomo Date: Wed, 17 Nov 2021 14:51:54 +0100 Subject: [PATCH] code cleaning --- vcg/complex/algorithms/geodesic.h | 25 ++++++------------------- 1 file changed, 6 insertions(+), 19 deletions(-) diff --git a/vcg/complex/algorithms/geodesic.h b/vcg/complex/algorithms/geodesic.h index db45cd2d..f0cb512d 100644 --- a/vcg/complex/algorithms/geodesic.h +++ b/vcg/complex/algorithms/geodesic.h @@ -138,12 +138,6 @@ public: - - - - - - /*! \brief class for computing approximate geodesic distances on a mesh require VF Adjacency relation @@ -582,26 +576,19 @@ It is just a simple wrapper of the basic Compute() template static void PerVertexDijkstraCompute(MeshType &m, const std::vector &seedVec, DistanceFunctor &distFunc, - ScalarType maxDistanceThr = std::numeric_limits::max(), - std::vector *InInterval=NULL, - typename MeshType::template PerVertexAttributeHandle * sourceHandle= NULL, - typename MeshType::template PerVertexAttributeHandle * parentHandle=NULL, - bool avoid_selected=false, - VertexPointer target=NULL) + ScalarType maxDistanceThr = std::numeric_limits::max(), + std::vector *InInterval=NULL, + typename MeshType::template PerVertexAttributeHandle * sourceHandle= NULL, + typename MeshType::template PerVertexAttributeHandle * parentHandle=NULL, + bool avoid_selected=false, + VertexPointer target=NULL) { tri::RequireVFAdjacency(m); tri::RequirePerVertexMark(m); tri::RequirePerVertexQuality(m); -// typename MeshType::template PerVertexAttributeHandle sourceHandle -// = tri::Allocator::template GetPerVertexAttribute(m, sourcesAttributeName()); - -// typename MeshType::template PerVertexAttributeHandle parentHandle -// = tri::Allocator::template GetPerVertexAttribute (m, parentsAttributeName()); - std::vector Heap; tri::UnMarkAll(m); - tri::UnMarkAll(m); for(size_t i=0;i