/**************************************************************************** * VCGLib o o * * Visual and Computer Graphics Library o o * * _ O _ * * Copyright(C) 2004-2016 \/)\/ * * 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. * * * ****************************************************************************/ #include #include #include #include #include #include using namespace vcg; using namespace std; class MyEdge; class MyFace; class MyVertex; struct MyUsedTypes : public UsedTypes< Use ::AsVertexType, Use ::AsEdgeType, Use ::AsFaceType>{}; class MyVertex : public Vertex{}; class MyFace : public Face< MyUsedTypes, face::VFAdj, face::VertexRef, face::Normal3f, face::BitFlags > {}; class MyEdge : public Edge{}; class MyMesh : public tri::TriMesh< vector, vector , vector > {}; int main( int argc, char **argv ) { if(argc<2) { printf("Usage trimesh_geodesic \n"); // return -1; } MyMesh m; // if(tri::io::ImporterPLY::Open(m,"../../meshes/disk_irregular_1k.ply")!=0) if(tri::io::ImporterPLY::Open(m,"../../meshes/disk_irregular_650k.ply")!=0) { printf("Error reading file %s\n",argv[1]); exit(0); } Point3f c=m.bbox.Center(); MyVertex*closest=&*m.vert.begin(); float minDist = Distance(closest->P(),c); for(MyMesh::VertexIterator vi=m.vert.begin();vi!=m.vert.end(); ++vi) { if(Distance(vi->P(),c)P(),c); closest = &*vi; } } vector seedVec; seedVec.push_back(closest); tri::EuclideanDistance ed; tri::Clean::RemoveUnreferencedVertex(m); tri::Allocator::CompactEveryVector(m); tri::UpdateTopology::VertexFace(m); tri::Geodesic::Compute(m,seedVec,ed); pair minmax = tri::Stat::ComputePerVertexQualityMinMax(m); tri::UpdateColor::PerVertexQualityRamp(m); printf("min %f max %f\n",minmax.first,minmax.second); tri::io::ExporterPLY::Save(m,"base.ply",tri::io::Mask::IOM_VERTCOLOR | tri::io::Mask::IOM_VERTQUALITY); int t0=clock(); tri::Geodesic::PerVertexDijsktraCompute(m,seedVec,ed); int t1=clock(); printf("Geodesic dijkstra %6.3f\n",float(t1-t0)/CLOCKS_PER_SEC); tri::UpdateColor::PerVertexQualityRamp(m); tri::io::ExporterPLY::Save(m,"base_d.ply",tri::io::Mask::IOM_VERTCOLOR | tri::io::Mask::IOM_VERTQUALITY); return 0; }