Added kdtree sample and updated a bit the comments of the other samples
This commit is contained in:
parent
84b9387264
commit
5adb83c8c9
|
@ -16,6 +16,7 @@ SUBDIRS = trimesh_base \
|
|||
trimesh_intersection \
|
||||
trimesh_isosurface \
|
||||
trimesh_join \
|
||||
trimesh_kdtree \
|
||||
trimesh_normal \
|
||||
trimesh_optional \
|
||||
trimesh_ray \
|
||||
|
|
|
@ -27,7 +27,6 @@
|
|||
|
||||
Attributes are a simple mechanism to associate user-defined 'attributes' to the simplicies and to the mesh.
|
||||
\ref attributes for more Details
|
||||
|
||||
*/
|
||||
|
||||
#include<vcg/complex/complex.h>
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
|
||||
\brief the minimal example of using the lib
|
||||
|
||||
This file contain a minimal example of the library
|
||||
This file contain a minimal example of the library, showing how to load a mesh and how to compute per vertex normals on it.
|
||||
|
||||
*/
|
||||
|
||||
|
@ -60,7 +60,8 @@ int main( int argc, char **argv )
|
|||
printf("Usage trimesh_base <meshfilename.obj>\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
/*! we simply
|
||||
*/
|
||||
MyMesh m;
|
||||
|
||||
if(vcg::tri::io::ImporterOFF<MyMesh>::Open(m,argv[1])!=vcg::tri::io::ImporterOFF<MyMesh>::NoError)
|
||||
|
|
|
@ -0,0 +1,85 @@
|
|||
/****************************************************************************
|
||||
* VCGLib o o *
|
||||
* Visual and Computer Graphics Library o o *
|
||||
* _ O _ *
|
||||
* Copyright(C) 2004-2012 \/)\/ *
|
||||
* 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. *
|
||||
* *
|
||||
****************************************************************************/
|
||||
/*! \file trimesh_kdtree.cpp
|
||||
\ingroup code_sample
|
||||
|
||||
\brief An example about using the kdtree and meshes
|
||||
|
||||
KdTree are one of the Spatial indexing data structure available.
|
||||
They are tailored for storing point-based structures and performing k-neighbours queries.
|
||||
In this simple example we simply compute the average distance of a vertex from its neighbours.
|
||||
\ref spatial_indexing for more Details
|
||||
*/
|
||||
|
||||
#include<vcg/complex/complex.h>
|
||||
|
||||
#include<wrap/io_trimesh/import.h>
|
||||
#include<wrap/io_trimesh/export.h>
|
||||
#include <vcg/space/index/kdtree/kdtree.h>
|
||||
#include<vcg/complex/algorithms/update/normal.h>
|
||||
#include<vcg/complex/algorithms/update/color.h>
|
||||
|
||||
using namespace vcg;
|
||||
using namespace std;
|
||||
|
||||
class MyEdge;
|
||||
class MyFace;
|
||||
class MyVertex;
|
||||
struct MyUsedTypes : public UsedTypes< Use<MyVertex> ::AsVertexType,
|
||||
Use<MyEdge> ::AsEdgeType,
|
||||
Use<MyFace> ::AsFaceType>{};
|
||||
|
||||
class MyVertex : public Vertex<MyUsedTypes, vertex::Coord3f, vertex::Normal3f, vertex::Qualityf, vertex::Color4b, vertex::BitFlags >{};
|
||||
class MyFace : public Face< MyUsedTypes, face::VertexRef, face::BitFlags > {};
|
||||
class MyEdge : public Edge<MyUsedTypes>{};
|
||||
class MyMesh : public tri::TriMesh< vector<MyVertex>, vector<MyFace> , vector<MyEdge> > {};
|
||||
|
||||
int main( int argc, char **argv )
|
||||
{
|
||||
if(argc<2) argv[1]="../../meshes/torus_irregular.ply";
|
||||
|
||||
MyMesh m;
|
||||
if(tri::io::Importer<MyMesh>::Open(m,argv[1])!=0)
|
||||
{
|
||||
printf("Error reading file %s\n",argv[1]);
|
||||
exit(0);
|
||||
}
|
||||
|
||||
VertexConstDataWrapper<MyMesh> ww(m);
|
||||
|
||||
KdTree<float> tree(ww);
|
||||
tree.setMaxNofNeighbors(3);
|
||||
for (int j = 0; j < m.VN(); j++) {
|
||||
tree.doQueryK(m.vert[j].cP());
|
||||
int neighbours = tree.getNofFoundNeighbors();
|
||||
float avgDist=0;
|
||||
for (int i = 0; i < neighbours; i++) {
|
||||
int neightId = tree.getNeighborId(i);
|
||||
avgDist+=Distance(m.vert[j].cP(),m.vert[neightId].cP());
|
||||
}
|
||||
m.vert[j].Q() = avgDist/=neighbours;
|
||||
}
|
||||
tri::UpdateColor<MyMesh>::PerVertexQualityRamp(m);
|
||||
tri::io::ExporterPLY<MyMesh>::Save(m,"out.ply",tri::io::Mask::IOM_VERTCOLOR+tri::io::Mask::IOM_VERTQUALITY);
|
||||
return 0;
|
||||
}
|
|
@ -0,0 +1,3 @@
|
|||
include(../common.pri)
|
||||
TARGET = trimesh_kdtree
|
||||
SOURCES += trimesh_kdtree.cpp ../../../wrap/ply/plylib.cpp
|
|
@ -20,6 +20,12 @@
|
|||
* for more details. *
|
||||
* *
|
||||
****************************************************************************/
|
||||
/*! \file trimesh_normal.cpp
|
||||
\ingroup code_sample
|
||||
|
||||
\brief An example of all the methods for computing normals over a mesh.
|
||||
|
||||
*/
|
||||
#include<vcg/complex/complex.h>
|
||||
|
||||
#include<wrap/io_trimesh/import_off.h>
|
||||
|
|
Loading…
Reference in New Issue