manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Ongoing Rearrangement of filepath 

replaced the path to comply the filepaths modification.
The replacements are as follows:

/complex/trimesh/base.h --> /complex/complex.h
/complex/trimesh/allocate.h --> /complex/allocate.h
/complex/trimesh/append.h --> /complex/append.h
/complex/trimesh/ --> /complex/algorithms/
/complex/local_optimization/ ---> /complex/algorithms/local_optimization/
/complex/local_optimization.h ---> /complex/algorithms/local_optimization.h
/complex/intersection.h ---> /complex/algorithms/intersection.h
/complex/boundary.h ---> /complex/algorithms/boundary.h
This commit is contained in:
ganovelli 2011-04-01 17:06:03 +00:00
parent fea1228701
commit 9ff0ad3f1e
50 changed files with 134 additions and 134 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
vcg/complex/algorithms/attribute_seam.h
View File

@ -3,7 +3,7 @@
#include <vector>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/allocate.h>
/*

8
vcg/complex/algorithms/autoalign_4pcs.h
View File

@ -38,13 +38,13 @@ used in the paper pseudocode.
#include <vcg/math/matrix44.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/trimesh/update/bounding.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/complex/algorithms/update/bounding.h>
#include <vcg/simplex/vertex/base.h>
#include <vcg/simplex/face/base.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/stat.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/stat.h>
#include <wrap/io_trimesh/export_ply.h>

4
vcg/complex/algorithms/bitquad_creation.h
View File

@ -1,5 +1,5 @@
#include <vcg/complex/trimesh/bitquad_support.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/algorithms/bitquad_support.h>
#include <vcg/complex/allocate.h>
/** BIT-QUAD creation support:
a collection of methods that,

2
vcg/complex/algorithms/bitquad_support.h
View File

@ -2,7 +2,7 @@
#define VCG_BITQUAD_SUPPORT
#include <vector>
#include <set>
#include <vcg/complex/trimesh/subset.h>
#include <vcg/complex/algorithms/subset.h>
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/space/planar_polygon_tessellation.h>

14
vcg/complex/algorithms/clean.h
View File

@ -32,15 +32,15 @@
// VCG headers
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/space/index/spatial_hashing.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/trimesh/update/selection.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/allocate.h>
#include <vcg/complex/algorithms/update/selection.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/space/triangle3.h>

2
vcg/complex/algorithms/closest.h
View File

@ -135,7 +135,7 @@ header added
#include <vcg/simplex/vertex/distance.h>
#include <vcg/space/intersection3.h>
#include <vcg/space/index/space_iterators.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/complex.h>
namespace vcg {
namespace tri {

6
vcg/complex/algorithms/clustering.h
View File

@ -62,10 +62,10 @@ First working Version
#ifndef __VCGLIB_CLUSTERING
#define __VCGLIB_CLUSTERING
#include<vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/clean.h>
#include<vcg/complex/complex.h>
#include <vcg/complex/algorithms/clean.h>
#include<vcg/space/triangle3.h>
#include<vcg/complex/trimesh/update/topology.h>
#include<vcg/complex/algorithms/update/topology.h>
#include<vcg/space/index/grid_util.h>
#include <iostream>

4
vcg/complex/algorithms/crease_cut.h
View File

@ -24,8 +24,8 @@
#ifndef __VCG_CREASE_CUT
#define __VCG_CREASE_CUT
#include<vcg/simplex/face/jumping_pos.h>
#include<vcg/complex/trimesh/append.h>
#include<vcg/complex/trimesh/update/normal.h>
#include<vcg/complex/append.h>
#include<vcg/complex/algorithms/update/normal.h>
namespace vcg {
namespace tri {

4
vcg/complex/algorithms/create/advancing_front.h
View File

@ -4,8 +4,8 @@
#include <iostream>
#include <list>
#include <wrap/callback.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <map>
namespace vcg {

2
vcg/complex/algorithms/create/ball_pivoting.h
View File

@ -3,7 +3,7 @@
#include "advancing_front.h"
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/algorithms/closest.h>
/* Ball pivoting algorithm:
1) the vertices used in the new mesh are marked as visited

10
vcg/complex/algorithms/create/extended_marching_cubes.h
View File

@ -33,11 +33,11 @@
#include <vcg/math/matrix.h>
#include <vcg/math/lin_algebra.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/trimesh/update/edges.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/trimesh/clean.h>
#include <vcg/complex/algorithms/update/edges.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/complex/allocate.h>
#include <vcg/complex/algorithms/clean.h>
#include <vcg/space/point3.h>
#include "emc_lookup_table.h"

2
vcg/complex/algorithms/create/marching_cubes.h
View File

@ -27,7 +27,7 @@
#include <assert.h>
#include <vcg/space/point3.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/allocate.h>
#include "mc_lookup_table.h"
namespace vcg

6
vcg/complex/algorithms/create/platonic.h
View File

@ -25,9 +25,9 @@
#define __VCGLIB_PLATONIC
#include<vcg/math/base.h>
#include<vcg/complex/trimesh/allocate.h>
#include<vcg/complex/trimesh/refine.h>
#include<vcg/complex/trimesh/update/flag.h>
#include<vcg/complex/allocate.h>
#include<vcg/complex/algorithms/refine.h>
#include<vcg/complex/algorithms/update/flag.h>
namespace vcg {
namespace tri {

12
vcg/complex/algorithms/create/resampler.h
View File

@ -23,13 +23,13 @@
#ifndef __VCG_MESH_RESAMPLER
#define __VCG_MESH_RESAMPLER
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/trimesh/update/bounding.h>
#include <vcg/complex/trimesh/update/edges.h>
#include <vcg/complex/trimesh/create/marching_cubes.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/complex/algorithms/update/bounding.h>
#include <vcg/complex/algorithms/update/edges.h>
#include <vcg/complex/algorithms/create/marching_cubes.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/box3.h>
namespace vcg {

2
vcg/complex/algorithms/edge_collapse.h
View File

@ -44,7 +44,7 @@
#include<vcg/simplex/face/pos.h>
#include<vcg/simplex/face/topology.h>
#include<vcg/complex/trimesh/allocate.h>
#include<vcg/complex/allocate.h>
namespace vcg{
namespace tri{

2
vcg/complex/algorithms/geodesic.h
View File

@ -39,7 +39,7 @@
#include <vcg/container/simple_temporary_data.h>
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/trimesh/update/quality.h>
#include <vcg/complex/algorithms/update/quality.h>
#include <deque>
#include <vector>
#include <list>

2
vcg/complex/algorithms/halfedge_quad_clean.h
View File

@ -1,7 +1,7 @@
#ifndef HALFEDGEQUADCLEAN_H
#define HALFEDGEQUADCLEAN_H
#include <vcg/complex/trimesh/update/halfedge_topology.h>
#include <vcg/complex/algorithms/update/halfedge_topology.h>
#include <queue>
#include <set>
#include<vcg/math/base.h>

2
vcg/complex/algorithms/hole.h
View File

@ -139,7 +139,7 @@ First Non working Version
#include <wrap/callback.h>
#include <vcg/math/base.h>
#include <vcg/complex/trimesh/clean.h>
#include <vcg/complex/algorithms/clean.h>
#include <vcg/space/point3.h>
#include <vector>
#include <float.h>

2
vcg/complex/algorithms/inertia.h
View File

@ -59,7 +59,7 @@ journal of graphics tools, volume 1, number 2, 1996
#include <vcg/math/matrix33.h>
#include <vcg/math/lin_algebra.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/algorithms/update/normal.h>
namespace vcg
{
namespace tri

8
vcg/complex/algorithms/intersection.h
View File

@ -58,10 +58,10 @@ added vcg header
#include<vcg/space/segment3.h>
#include<vcg/space/intersection3.h>
#include<vcg/complex/edgemesh/allocate.h>
#include<vcg/complex/trimesh/allocate.h>
#include<vcg/complex/trimesh/subset.h>
#include<vcg/complex/trimesh/closest.h>
#include<vcg/complex/trimesh/base.h>
#include<vcg/complex/allocate.h>
#include<vcg/complex/algorithms/subset.h>
#include<vcg/complex/algorithms/closest.h>
#include<vcg/complex/complex.h>
#ifndef __VCGLIB_INTERSECTION_TRI_MESH
#define __VCGLIB_INTERSECTION_TRI_MESH

2
vcg/complex/algorithms/local_optimization.h
View File

@ -95,7 +95,7 @@
#include<algorithm>
#include<time.h>
#include<math.h>
#include<vcg/complex/trimesh/base.h>
#include<vcg/complex/complex.h>
namespace vcg{

6
vcg/complex/algorithms/local_optimization/quad_diag_collapse.h
View File

@ -2,14 +2,14 @@
#define QUAD_DIAGONAL_COLLAPSE_H
#include<vcg/connectors/halfedge_pos.h>
#include<vcg/complex/local_optimization.h>
#include<vcg/complex/trimesh/smooth.h>
#include<vcg/complex/algorithms/local_optimization.h>
#include<vcg/complex/algorithms/smooth.h>
#include<set>
#include<vcg/space/ray3.h>
#include<vcg/complex/trimesh/halfedge_quad_clean.h>
#include<vcg/complex/algorithms/halfedge_quad_clean.h>
namespace vcg{
namespace tri{

2
vcg/complex/algorithms/local_optimization/tetra_edge_collapse.h
View File

@ -27,7 +27,7 @@
#ifndef __VCG_DECIMATION_COLLAPSE
#define __VCG_DECIMATION_COLLAPSE
#include<vcg/complex/local_optimization.h>
#include<vcg/complex/algorithms/local_optimization.h>
#include<vcg/simplex/tetrahedron/pos.h>
#include<vcg/complex/tetramesh/edge_collapse.h>
#include<vcg/space/point3.h>

4
vcg/complex/algorithms/local_optimization/tri_edge_collapse.h
View File

@ -64,9 +64,9 @@
#ifndef __VCG_DECIMATION_TRICOLLAPSE
#define __VCG_DECIMATION_TRICOLLAPSE
#include<vcg/complex/trimesh/edge_collapse.h>
#include<vcg/complex/algorithms/edge_collapse.h>
#include<vcg/simplex/face/pos.h>
#include<vcg/complex/local_optimization.h>
#include<vcg/complex/algorithms/local_optimization.h>
namespace vcg{

10
vcg/complex/algorithms/local_optimization/tri_edge_collapse_quadric.h
View File

@ -76,11 +76,11 @@ corrected error in -error (see localoptimization)
#include<vcg/math/quadric.h>
#include<vcg/simplex/face/pos.h>
#include<vcg/complex/trimesh/update/flag.h>
#include<vcg/complex/trimesh/update/topology.h>
#include<vcg/complex/trimesh/update/bounding.h>
#include<vcg/complex/local_optimization/tri_edge_collapse.h>
#include<vcg/complex/local_optimization.h>
#include<vcg/complex/algorithms/update/flag.h>
#include<vcg/complex/algorithms/update/topology.h>
#include<vcg/complex/algorithms/update/bounding.h>
#include<vcg/complex/algorithms/local_optimization/tri_edge_collapse.h>
#include<vcg/complex/algorithms/local_optimization.h>
namespace vcg{

2
vcg/complex/algorithms/local_optimization/tri_edge_flip.h
View File

@ -24,7 +24,7 @@
#ifndef __VCG_DECIMATION_TRIFLIP
#define __VCG_DECIMATION_TRIFLIP
#include <vcg/complex/local_optimization.h>
#include <vcg/complex/algorithms/local_optimization.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/space/triangle3.h>

4
vcg/complex/algorithms/nring.h
View File

@ -25,8 +25,8 @@
****************************************************************************/
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/allocate.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vector>
namespace vcg

4
vcg/complex/algorithms/overlap_estimation.h
View File

@ -27,8 +27,8 @@
#include <vcg/math/gen_normal.h>
#include <vcg/math/random_generator.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/trimesh/point_sampling.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/complex/algorithms/point_sampling.h>
#include <qdatetime.h>

10
vcg/complex/algorithms/point_sampling.h
View File

@ -36,12 +36,12 @@ sampling strategies (montecarlo, stratified etc).
#define __VCGLIB_POINT_SAMPLING
#include <vcg/math/random_generator.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/index/spatial_hashing.h>
#include <vcg/complex/trimesh/stat.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/algorithms/stat.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/space/box2.h>
#include <vcg/space/segment2.h>

4
vcg/complex/algorithms/polygon_support.h
View File

@ -25,7 +25,7 @@
#define __VCGLIB_POLYGON_SUPPORT
#include <vector>
#include <vcg/complex/trimesh/subset.h>
#include <vcg/complex/algorithms/subset.h>
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/space/planar_polygon_tessellation.h>
@ -34,7 +34,7 @@ namespace vcg
namespace tri{
/// \ingroup trimesh
/// \headerfile polygon_support.h vcg/complex/trimesh/polygon_support.h
/// \headerfile polygon_support.h vcg/complex/algorithms/polygon_support.h
/// \brief This class is used convert between polygonal meshes and triangular meshes

6
vcg/complex/algorithms/refine.h
View File

@ -32,10 +32,10 @@
#include <vcg/space/texcoord2.h>
#include <vcg/space/color4.h>
#include <vcg/simplex/face/pos.h>
#include<vcg/complex/trimesh/allocate.h>
#include<vcg/complex/trimesh/update/topology.h>
#include<vcg/complex/allocate.h>
#include<vcg/complex/algorithms/update/topology.h>
#include<wrap/callback.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/complex.h>
#include <vcg/space/triangle3.h>
namespace vcg{

8
vcg/complex/algorithms/refine_loop.h
View File

@ -32,12 +32,12 @@
#include <cmath>
#include <vcg/space/point3.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/refine.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/refine.h>
#include <vcg/space/color4.h>
#include <vcg/container/simple_temporary_data.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/trimesh/update/color.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/complex/algorithms/update/color.h>
namespace vcg{

6
vcg/complex/algorithms/smooth.h
View File

@ -29,9 +29,9 @@
#include <vcg/space/point3.h>
#include <vcg/space/ray3.h>
#include <vcg/container/simple_temporary_data.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/halfedge_topology.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/halfedge_topology.h>
#include <vcg/complex/algorithms/closest.h>
namespace vcg

6
vcg/complex/algorithms/stat.h
View File

@ -44,10 +44,10 @@ Initial Commit
#include <vcg/math/histogram.h>
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/closest.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/allocate.h>
namespace vcg {

2
vcg/complex/algorithms/subset.h
View File

@ -60,7 +60,7 @@ Added History Info
#ifndef __VCGLIB_TRISUBSET
#define __VCGLIB_TRISUBSET
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/algorithms/update/flag.h>
namespace vcg {
namespace tri {

2
vcg/complex/algorithms/update/bounding.h
View File

@ -56,7 +56,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile bounding.h vcg/complex/trimesh/update/bounding.h
/// \headerfile bounding.h vcg/complex/algorithms/update/bounding.h
/// \brief Management, updating and computation of per-vertex and per-face normals.
/**

6
vcg/complex/algorithms/update/color.h
View File

@ -28,16 +28,16 @@
#include <time.h>
#include <vcg/space/color4.h>
#include <vcg/math/histogram.h>
#include <vcg/complex/trimesh/stat.h>
#include <vcg/complex/algorithms/stat.h>
#include <vcg/math/perlin_noise.h>
#include <vcg/math/random_generator.h>
#include <vcg/complex/trimesh/clean.h>
#include <vcg/complex/algorithms/clean.h>
namespace vcg {
namespace tri {
/// \ingroup trimesh
/// \headerfile color.h vcg/complex/trimesh/update/color.h
/// \headerfile color.h vcg/complex/algorithms/update/color.h
/// \brief Generation of per-vertex and per-face colors according to various strategy.
/**

12
vcg/complex/algorithms/update/curvature.h
View File

@ -62,11 +62,11 @@ the vertex
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/container/simple_temporary_data.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/point_sampling.h>
#include <vcg/complex/trimesh/append.h>
#include <vcg/complex/intersection.h>
#include <vcg/complex/trimesh/inertia.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/point_sampling.h>
#include <vcg/complex/append.h>
#include <vcg/complex/algorithms/intersection.h>
#include <vcg/complex/algorithms/inertia.h>
#include <vcg/math/matrix33.h>
@ -75,7 +75,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile curvature.h vcg/complex/trimesh/update/curvature.h
/// \headerfile curvature.h vcg/complex/algorithms/update/curvature.h
/// \brief Management, updating and computation of per-vertex and per-face normals.
/**

14
vcg/complex/algorithms/update/curvature_fitting.h
View File

@ -34,11 +34,11 @@
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/container/simple_temporary_data.h>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/point_sampling.h>
#include <vcg/complex/trimesh/append.h>
#include <vcg/complex/intersection.h>
#include <vcg/complex/trimesh/inertia.h>
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/point_sampling.h>
#include <vcg/complex/append.h>
#include <vcg/complex/algorithms/intersection.h>
#include <vcg/complex/algorithms/inertia.h>
#include <vcg/math/matrix33.h>
#include <vcg/Eigen/Core>
@ -48,7 +48,7 @@
// GG include
#include <vector>
#include <vcg/complex/trimesh/nring.h>
#include <vcg/complex/algorithms/nring.h>
namespace vcg {
@ -56,7 +56,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile curvature_fitting.h vcg/complex/trimesh/update/curvature_fitting.h
/// \headerfile curvature_fitting.h vcg/complex/algorithms/update/curvature_fitting.h
/// \brief Computation of per-vertex directions and values of curvature.
/**

2
vcg/complex/algorithms/update/edges.h
View File

@ -47,7 +47,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile edges.h vcg/complex/trimesh/update/edges.h
/// \headerfile edges.h vcg/complex/algorithms/update/edges.h
/// \brief This class is used to compute or update the precomputed data used to efficiently compute point-face distances.
template <class ComputeMeshType>

18
vcg/complex/algorithms/update/fitmaps.h
View File

@ -27,15 +27,15 @@
#include <vcg/math/histogram.h>
#include <vcg/simplex/face/jumping_pos.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/allocate.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vector>
#include <set>
#include <vcg/complex/trimesh/update/normal.h>
#include <vcg/complex/trimesh/update/curvature.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/trimesh/update/bounding.h>
#include "vcg/complex/trimesh/update/curvature_fitting.h"
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/curvature.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/complex/algorithms/update/bounding.h>
#include "vcg/complex/algorithms/update/curvature_fitting.h"
#include <vcg/Eigen/Core>
#include <vcg/Eigen/QR>
@ -44,9 +44,9 @@
#include <algorithm>
#include <vcg/complex/trimesh/nring.h>
#include <vcg/complex/algorithms/nring.h>
#include <vcg/complex/trimesh/smooth.h>
#include <vcg/complex/algorithms/smooth.h>
using namespace Eigen;

2
vcg/complex/algorithms/update/flag.h
View File

@ -95,7 +95,7 @@ namespace vcg {
namespace tri {
/// \ingroup trimesh
/// \headerfile flag.h vcg/complex/trimesh/update/flag.h
/// \headerfile flag.h vcg/complex/algorithms/update/flag.h
/// \brief Management, updating and computation of per-vertex and per-face flags (like border flags).

12
vcg/complex/algorithms/update/halfedge_indexed.h
View File

@ -25,18 +25,18 @@
#define __VCGLIB_HALFEDGE_
#include <vector>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/trimesh/clean.h>
#include <vcg/complex/trimesh/update/topology.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/trimesh/update/halfedge_topology.h>
#include <vcg/complex/allocate.h>
#include <vcg/complex/algorithms/clean.h>
#include <vcg/complex/algorithms/update/topology.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/update/halfedge_topology.h>
namespace vcg
{
namespace tri{
/// \ingroup trimesh
/// \headerfile edge_support.h vcg/complex/trimesh/edge_support.h
/// \headerfile edge_support.h vcg/complex/algorithms/edge_support.h
/// \brief This class is used to build edge based data structure from indexed data structure and viceversa

2
vcg/complex/algorithms/update/halfedge_topology.h
View File

@ -2,7 +2,7 @@
#define VCG_HEDGE_TOPOLOGY
#include <vcg/connectors/halfedge_pos.h>
#include <vcg/complex/trimesh/allocate.h>
#include <vcg/complex/allocate.h>
#include <vector>
#include <set>

4
vcg/complex/algorithms/update/normal.h
View File

@ -26,7 +26,7 @@
#include <vcg/space/triangle3.h>
#include <vcg/math/matrix33.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/algorithms/update/flag.h>
namespace vcg {
@ -34,7 +34,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile normal.h vcg/complex/trimesh/update/normal.h
/// \headerfile normal.h vcg/complex/algorithms/update/normal.h
/// \brief Management, updating and computation of per-vertex and per-face normals.
/**

2
vcg/complex/algorithms/update/position.h
View File

@ -39,7 +39,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile position.h vcg/complex/trimesh/update/position.h
/// \headerfile position.h vcg/complex/algorithms/update/position.h
/// \brief This class is used to update vertex position according to a transformation matrix.
template <class ComputeMeshType>

6
vcg/complex/algorithms/update/quality.h
View File

@ -24,8 +24,8 @@
#define __VCG_TRI_UPDATE_QUALITY
#include <vcg/simplex/face/pos.h>
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/trimesh/stat.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/complex/algorithms/stat.h>
#include <algorithm>
#include <vector>
#include <stack>
@ -35,7 +35,7 @@ namespace vcg {
namespace tri {
/// \ingroup trimesh
/// \headerfile quality.h vcg/complex/trimesh/update/quality.h
/// \headerfile quality.h vcg/complex/algorithms/update/quality.h
/// \brief Generation of per-vertex and per-face qualities.
/**

4
vcg/complex/algorithms/update/selection.h
View File

@ -24,7 +24,7 @@
#define __VCG_TRI_UPDATE_SELECTION
#include <queue>
#include <vcg/complex/trimesh/update/flag.h>
#include <vcg/complex/algorithms/update/flag.h>
namespace vcg {
namespace tri {
@ -98,7 +98,7 @@ private:
/// \ingroup trimesh
/// \headerfile selection.h vcg/complex/trimesh/update/selection.h
/// \headerfile selection.h vcg/complex/algorithms/update/selection.h
/// \brief Management, updating and computation of per-vertex and per-face normals.
/**

2
vcg/complex/algorithms/update/texture.h
View File

@ -36,7 +36,7 @@ namespace tri {
/// \ingroup trimesh
/// \headerfile texture.h vcg/complex/trimesh/update/texture.h
/// \headerfile texture.h vcg/complex/algorithms/update/texture.h
/// \brief This class is used to update vertex position according to a transformation matrix.
template <class ComputeMeshType>

8
vcg/complex/algorithms/update/topology.h
View File

@ -91,12 +91,12 @@ Initial commit
#include <algorithm>
#include <vector>
#include <vcg/simplex/face/pos.h>
#include <vcg/complex/trimesh/base.h>
#include <vcg/complex/complex.h>
namespace vcg {
namespace tri {
/// \ingroup trimesh
/// \headerfile topology.h vcg/complex/trimesh/update/topology.h
/// \headerfile topology.h vcg/complex/algorithms/update/topology.h
/// \brief Generation of per-vertex and per-face topological information.
@ -114,7 +114,7 @@ typedef typename MeshType::FacePointer FacePointer;
typedef typename MeshType::FaceIterator FaceIterator;
/// \headerfile topology.h vcg/complex/trimesh/update/topology.h
/// \headerfile topology.h vcg/complex/algorithms/update/topology.h
/// \brief Auxiliairy data structure for computing face face adjacency information.
/**
@ -277,7 +277,7 @@ static void VertexFace(MeshType &m)
}
/// \headerfile topology.h vcg/complex/trimesh/update/topology.h
/// \headerfile topology.h vcg/complex/algorithms/update/topology.h
/// \brief Auxiliairy data structure for computing face face adjacency information.
/**