Cleaned unsupported/trimeshinfo folder
This commit is contained in:
parent
219a8fda23
commit
ad146d8c0f
Binary file not shown.
Binary file not shown.
|
|
@ -1,48 +0,0 @@
|
|||
// -----------------------------------------------------------------------------------------------
|
||||
#ifndef _DEFS_H
|
||||
#define _DEFS_H
|
||||
// -----------------------------------------------------------------------------------------------
|
||||
|
||||
// command line parameters
|
||||
#define CMD_LINE_ARG_HIST 'H'
|
||||
#define CMD_LINE_ARG_VERTEX_SAMPLE 'V'
|
||||
#define CMD_LINE_ARG_EDGE_SAMPLE 'E'
|
||||
#define CMD_LINE_ARG_FACE_SAMPLE 'F'
|
||||
#define CMD_LINE_ARG_SAMPLE_TYPE 'S'
|
||||
#define CMD_LINE_ARG_MONTECARLO_SAMPLING 'M'
|
||||
#define CMD_LINE_ARG_SUBDIVISION_SAMPLING 'S'
|
||||
#define CMD_LINE_ARG_SIMILAR_TRIANGLES_SAMPLING 'T'
|
||||
#define CMD_LINE_ARG_N_SAMPLES 'N'
|
||||
#define CMD_LINE_ARG_SAMPLES_PER_AREA_UNIT 'A'
|
||||
#define CMD_LINE_ARG_SAVE_DISPLACEMENT 'O'
|
||||
#define CMD_LINE_ARG_SAVE_ERROR_AS_COLOUR 'C'
|
||||
|
||||
|
||||
// error messages
|
||||
#define MSG_ERR_N_ARGS "\nUsage: "\
|
||||
"trimeshinfo filename \n"
|
||||
|
||||
#define MSG_ERR_MESH_LOAD "error loading the input meshes.\n"
|
||||
#define MSG_ERR_INVALID_OPTION "unable to parse option '%s'\n"
|
||||
#define MSG_ERR_FILE_OPEN "unable to open the output file.'n"
|
||||
#define MSG_ERR_UNKNOWN_FORMAT "unknown file format '%s'.\n"
|
||||
|
||||
// global constants
|
||||
#define NO_SAMPLES_PER_FACE 10
|
||||
#define N_SAMPLES_EDGE_TO_FACE_RATIO 0.1
|
||||
#define BBOX_FACTOR 0.1
|
||||
#define INFLATE_PERCENTAGE 0.02
|
||||
#define MIN_SIZE 125 /* 125 = 5^3 */
|
||||
#define N_HIST_BINS 256
|
||||
#define PRINT_EVERY_N_ELEMENTS 1000
|
||||
#define FILE_EXT_SMF "smf"
|
||||
#define FILE_EXT_PLY "ply"
|
||||
|
||||
// strings
|
||||
#define STR_HIST_FILENAME_DEFAULT "hist.txt"
|
||||
#define STR_NEW_MESH_FILENAME_DEFAULT "error.ply"
|
||||
#define STR_NEW_MESH_FILENAME_DEFAULT_2 "error_colour.ply"
|
||||
|
||||
// -----------------------------------------------------------------------------------------------
|
||||
#endif
|
||||
// -----------------------------------------------------------------------------------------------
|
||||
|
|
@ -1,683 +0,0 @@
|
|||
/****************************************************************************
|
||||
* 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. *
|
||||
* *
|
||||
****************************************************************************/
|
||||
/****************************************************************************
|
||||
History
|
||||
|
||||
$Log: not supported by cvs2svn $
|
||||
Revision 1.7 2005/02/07 15:44:31 rita_borgo
|
||||
Fixed Color and Volume
|
||||
|
||||
Revision 1.6 2005/02/01 17:37:53 rita_borgo
|
||||
Fixed Volume and Color
|
||||
|
||||
Revision 1.5 2005/01/18 16:33:12 rita_borgo
|
||||
Added OFF file Option
|
||||
|
||||
Revision 1.4 2005/01/17 18:19:00 rita_borgo
|
||||
Added new routines.
|
||||
Self-intersection first release
|
||||
|
||||
Revision 1.2 2005/01/03 16:13:09 rita_borgo
|
||||
Added Standard comments
|
||||
|
||||
|
||||
|
||||
****************************************************************************/
|
||||
#include <vector>
|
||||
#include <string>
|
||||
#include <stack>
|
||||
|
||||
|
||||
using namespace std;
|
||||
|
||||
|
||||
#include<vcg/simplex/vertex/vertex.h>
|
||||
#include<vcg/simplex/face/with/afav.h>
|
||||
#include<vcg/simplex/face/topology.h>
|
||||
#include<vcg/simplex/face/pos.h> // mi sembra di averlo aggiunto!
|
||||
|
||||
|
||||
#include<vcg/complex/complex.h>
|
||||
#include<vcg/complex/algorithms/update/topology.h>
|
||||
#include <vcg/complex/algorithms/update/edges.h>
|
||||
#include <vcg/complex/algorithms/update/bounding.h>
|
||||
#include <vcg/complex/algorithms/clean.h>
|
||||
#include <vcg/space/intersection/triangle_triangle3.h>
|
||||
#include <vcg/math/histogram.h>
|
||||
#include <wrap/io_trimesh/import.h>
|
||||
#include <wrap/io_trimesh/export_ply.h>
|
||||
|
||||
|
||||
// loader
|
||||
#include<wrap/io_trimesh/import_ply.h>
|
||||
|
||||
#include "defs.h"
|
||||
|
||||
using namespace vcg;
|
||||
using namespace tri;
|
||||
using namespace face;
|
||||
|
||||
class MyFace;
|
||||
class MyEdge;
|
||||
class MyVertex:public Vertex<float,MyEdge,MyFace>{};
|
||||
class MyFace :public FaceAFAV<MyVertex,MyEdge,MyFace>{};
|
||||
class MyMesh: public tri::TriMesh< std::vector<MyVertex>, std::vector<MyFace > >{};
|
||||
|
||||
void OpenMesh(const char *filename, MyMesh &m)
|
||||
{
|
||||
int err = tri::io::Importer<MyMesh>::Open(m,filename);
|
||||
if(err) {
|
||||
printf("Error in reading %s: '%s'\n",filename,tri::io::Importer<MyMesh>::ErrorMsg(err));
|
||||
exit(-1);
|
||||
}
|
||||
printf("read mesh `%s'\n", filename);
|
||||
}
|
||||
|
||||
|
||||
inline char* GetExtension(char* filename)
|
||||
{
|
||||
for(int i=strlen(filename)-1; i >= 0; i--)
|
||||
if(filename[i] == '.')
|
||||
break;
|
||||
if(i > 0)
|
||||
return &(filename[i+1]);
|
||||
else
|
||||
return NULL;
|
||||
}
|
||||
|
||||
|
||||
typedef MyMesh::VertexPointer VertexPointer;
|
||||
typedef MyMesh::VertexIterator VertexIterator;
|
||||
|
||||
/* classe di confronto per l'algoritmo di individuazione vertici duplicati*/
|
||||
template <class VertexIterator>
|
||||
class DuplicateVert_Compare{
|
||||
public:
|
||||
inline bool operator() (VertexIterator a, VertexIterator b)
|
||||
{
|
||||
return *a < *b;
|
||||
}
|
||||
};
|
||||
|
||||
static int DuplicateVertex( MyMesh & m ) // V1.0
|
||||
{
|
||||
if(m.vert.size()==0 || m.vn==0)
|
||||
return 0;
|
||||
std::map<VertexPointer, VertexPointer> mp;
|
||||
int i,j;
|
||||
VertexIterator vi;
|
||||
int deleted=0;
|
||||
int k=0;
|
||||
int num_vert = m.vert.size();
|
||||
vector<VertexPointer> perm(num_vert);
|
||||
for(vi=m.vert.begin(); vi!=m.vert.end(); ++vi, ++k)
|
||||
perm[k] = &(*vi);
|
||||
|
||||
DuplicateVert_Compare<VertexPointer> c_obj;
|
||||
|
||||
std::sort(perm.begin(),perm.end(),c_obj);
|
||||
j = 0;
|
||||
i = j;
|
||||
mp[perm[i]] = perm[j];
|
||||
++i;
|
||||
for(;i!=num_vert;)
|
||||
{
|
||||
if( (! (*perm[i]).IsD()) &&
|
||||
(! (*perm[j]).IsD()) &&
|
||||
(*perm[i]).P() == (*perm[j]).cP() )
|
||||
{
|
||||
VertexPointer t = perm[i];
|
||||
mp[perm[i]] = perm[j];
|
||||
++i;
|
||||
(*t).SetD();
|
||||
deleted++;
|
||||
}
|
||||
else
|
||||
{
|
||||
j = i;
|
||||
++i;
|
||||
}
|
||||
}
|
||||
return deleted;
|
||||
}
|
||||
void main(int argc,char ** argv){
|
||||
|
||||
char *fmt;
|
||||
MyMesh m;
|
||||
bool DEBUG = false;
|
||||
//load the mesh
|
||||
//argv[1]=(char*)"c:\\checkup\\debug\\column1m.ply";
|
||||
//argv[1] = "C:\\sf\\apps\\msvc\\trimeshinfo\\Release\\prism.off";
|
||||
//argv[1] = "C:\\sf\\apps\\msvc\\trimeshinfo\\Release\\prova1.ply";
|
||||
|
||||
// print program info
|
||||
printf("-------------------------------\n"
|
||||
" TriMeshInfo V.1.01 \n"
|
||||
" http://vcg.isti.cnr.it\n"
|
||||
" release date: "__DATE__"\n"
|
||||
"-------------------------------\n\n");
|
||||
|
||||
|
||||
if(DEBUG)
|
||||
argv[1] = "C:\\sf\\apps\\msvc\\trimeshinfo\\Release\\cube1.stl";
|
||||
|
||||
else
|
||||
{
|
||||
// load input meshes.
|
||||
if(argc <= 1)
|
||||
{
|
||||
printf(MSG_ERR_N_ARGS);
|
||||
exit(-1);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
OpenMesh(argv[1],m);
|
||||
|
||||
|
||||
|
||||
FILE * index;
|
||||
index = fopen((string(argv[1])+string("2.html")).c_str(),"w");
|
||||
fprintf(index,"<p>Mesh info: %s </p>\n\n\n", argv[1]);
|
||||
|
||||
fprintf(index,"<p>GENERAL INFO </p>\n\n");
|
||||
fprintf(index,"<p>Number of vertices: %d </p>\n", m.vn);
|
||||
fprintf(index,"<p>Number of faces: %d </p>\n", m.fn);
|
||||
printf("Mesh info:\n");
|
||||
printf(" M: '%s'\n\t Number of vertices: %d \n", argv[1], m.vn);
|
||||
printf("\t Number of faces: %d \n", m.fn);
|
||||
|
||||
if(m.HasPerFaceColor()||m.HasPerVertexColor())
|
||||
{
|
||||
Color4b Color=m.C();
|
||||
fprintf(index, "<p>Object color(4b): %f %f %f </p>\n\n", Color[0], Color[1], Color[2]);
|
||||
printf( "\t Object color(4b): %f %f %f \n", Color[0], Color[1], Color[2]);
|
||||
}
|
||||
|
||||
|
||||
vcg::tri::UpdateTopology<MyMesh>::FaceFace(m);
|
||||
|
||||
// IS MANIFOLD
|
||||
|
||||
MyMesh::FaceIterator f;
|
||||
MyMesh::FaceIterator g;
|
||||
vcg::face::Pos<MyMesh::FaceType> he;
|
||||
vcg::face::Pos<MyMesh::FaceType> hei;
|
||||
int j;
|
||||
int man=0;
|
||||
bool Manifold = true;
|
||||
|
||||
MyMesh::FaceIterator prova;
|
||||
prova = m.face.end();
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
for (j=0;j<3;++j)
|
||||
{
|
||||
if(!IsManifold(*f,j))
|
||||
{
|
||||
Manifold = false;
|
||||
f= m.face.end();
|
||||
--f;
|
||||
j=3;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!Manifold)
|
||||
{
|
||||
fprintf(index, "<p> Manifold: NO </p>");
|
||||
printf( "\t Manifold: NO\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Manifold: YES </p>");
|
||||
printf( "\t Manifold: YES\n ");
|
||||
}
|
||||
|
||||
// COUNT EDGES
|
||||
|
||||
MyMesh::FaceIterator fi;
|
||||
int count_e = 0;
|
||||
bool counted=false;
|
||||
for(fi=m.face.begin();fi!=m.face.end();++fi)
|
||||
(*fi).ClearS();
|
||||
|
||||
for(fi=m.face.begin();fi!=m.face.end();++fi)
|
||||
{
|
||||
(*fi).SetS();
|
||||
count_e +=3;
|
||||
for(int i=0; i<3; ++i)
|
||||
{
|
||||
if (IsManifold(*fi,i))
|
||||
{
|
||||
if((*fi).FFp(i)->IsS())
|
||||
count_e--;
|
||||
}
|
||||
else
|
||||
{
|
||||
hei.Set(&(*fi), i , fi->V(i));
|
||||
he=hei;
|
||||
he.NextF();
|
||||
while (he.f!=hei.f)
|
||||
{
|
||||
if (he.f->IsS())
|
||||
{
|
||||
counted=true;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
he.NextF();
|
||||
}
|
||||
}
|
||||
if (counted)
|
||||
{
|
||||
count_e--;
|
||||
counted=false;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
fprintf(index, "<p>Number of edges: %d </p>\n", count_e);
|
||||
printf("\t Number of edges: %d \n", count_e);
|
||||
|
||||
|
||||
// DA QUI IN POI!!!
|
||||
|
||||
// DEGENERATED FACES
|
||||
|
||||
int count_fd = 0;
|
||||
for(fi=m.face.begin(); fi!=m.face.end();++fi)
|
||||
if((*fi).Area() == 0)
|
||||
count_fd++;
|
||||
fprintf(index, "<p>Number of degenerated faces: %d </p>\n", count_fd);
|
||||
printf("\t Number of degenerated faces: %d \n", count_fd);
|
||||
|
||||
// UNREFERENCED VERTEX
|
||||
|
||||
int count_uv = 0;
|
||||
MyMesh::VertexIterator v;
|
||||
|
||||
|
||||
|
||||
for(v=m.vert.begin();v!=m.vert.end();++v)
|
||||
(*v).ClearV();
|
||||
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
for(j=0;j<3;++j)
|
||||
(*f).V(j)->SetV();
|
||||
|
||||
for(v=m.vert.begin();v!=m.vert.end();++v)
|
||||
if( !(*v).IsV() )
|
||||
++count_uv;
|
||||
fprintf(index,"<p>Number of unreferenced vertices: %d</p>\n",count_uv);
|
||||
printf("\t Number of unreferenced vertices: %d\n",count_uv);
|
||||
|
||||
|
||||
// HOLES COUNT
|
||||
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
(*f).ClearS();
|
||||
g=m.face.begin(); f=g;
|
||||
|
||||
int BEdges=0; int numholes=0;
|
||||
|
||||
|
||||
if (Manifold)
|
||||
{
|
||||
for(f=g;f!=m.face.end();++f)
|
||||
{
|
||||
if(!(*f).IsS())
|
||||
{
|
||||
for(j=0;j<3;j++)
|
||||
{
|
||||
if ((*f).IsBorder(j))
|
||||
{
|
||||
BEdges++;
|
||||
|
||||
if(!(IsManifold(*f,j)))
|
||||
{
|
||||
(*f).SetS();
|
||||
hei.Set(&(*f),j,f->V(j));
|
||||
he=hei;
|
||||
do
|
||||
{
|
||||
he.NextB();
|
||||
he.f->SetS();
|
||||
// BEdges++;
|
||||
}
|
||||
while (he.f!=hei.f);
|
||||
//BEdges--;
|
||||
numholes++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
for(f=g;f!=m.face.end();++f)
|
||||
{
|
||||
for(j=0;j<3;j++)
|
||||
{
|
||||
if ((*f).IsBorder(j))
|
||||
{
|
||||
BEdges++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (Manifold)
|
||||
{
|
||||
fprintf(index, "<p> Number of holes: %d </p> \n <p> Number of border edges: %d </p>", numholes, BEdges);
|
||||
printf("\t Number of holes: %d \n", numholes, BEdges);
|
||||
printf("\t Number of border edges: %d\n", numholes, BEdges);
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Number of border edges: %d </p>", BEdges);
|
||||
printf("\t Number of border edges: %d\n", BEdges);
|
||||
}
|
||||
|
||||
// Mesh Volume
|
||||
float vol = m.Volume();
|
||||
int nuh = numholes;
|
||||
if((m.Volume()>0.)&&(Manifold)&&(numholes==0))
|
||||
{
|
||||
fprintf(index,"<p>Volume: %d </p>\n", m.Volume());
|
||||
printf("\t Volume: %f \n", m.Volume());
|
||||
}
|
||||
|
||||
|
||||
// CONNECTED COMPONENTS
|
||||
|
||||
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
(*f).ClearS();
|
||||
g=m.face.begin(); f=g;
|
||||
int CountComp=0; int CountOrient=0;
|
||||
stack<MyMesh::FaceIterator> sf;
|
||||
MyMesh::FaceType *l;
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
if (!(*f).IsS())
|
||||
{
|
||||
(*f).SetS();
|
||||
sf.push(f);
|
||||
while (!sf.empty())
|
||||
{
|
||||
g=sf.top();
|
||||
he.Set(&(*g),0,g->V(0));
|
||||
sf.pop();
|
||||
for(j=0;j<3;++j)
|
||||
if( !(*g).IsBorder(j) )
|
||||
{
|
||||
l=he.f->FFp(j);
|
||||
if( !(*l).IsS() )
|
||||
{
|
||||
(*l).SetS();
|
||||
sf.push(l);
|
||||
}
|
||||
}
|
||||
}
|
||||
CountComp++;
|
||||
}
|
||||
}
|
||||
fprintf(index, "<p> Number of connected components: %d </p>", CountComp);
|
||||
printf("\t Number of connected components: %d\n", CountComp);
|
||||
|
||||
if(CountComp ==1)
|
||||
{
|
||||
int eulero; //v-e+f
|
||||
eulero = (m.vn-count_uv)- (count_e+BEdges)+m.fn;
|
||||
if(Manifold)
|
||||
{
|
||||
int genus = (2-eulero)>>1;
|
||||
fprintf(index, "<p> Genus: %d </p> \n ", genus);
|
||||
printf( "\t Genus: %d \n", genus);
|
||||
}
|
||||
}
|
||||
// REGULARITY
|
||||
|
||||
bool Regular=true;
|
||||
bool Semiregular=true;
|
||||
int inc=0;
|
||||
for(v=m.vert.begin();v!=m.vert.end();++v)
|
||||
(*v).ClearS();
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
for (j=0; j<3; j++)
|
||||
{
|
||||
he.Set(&(*f),j,f->V(j));
|
||||
if (!(*f).IsBorder(j) && !(*f).IsBorder((j+2)%3) && !f->V(j)->IsS())
|
||||
{
|
||||
hei=he;
|
||||
inc=1;
|
||||
he.FlipE();
|
||||
he.NextF();
|
||||
while (he.f!=hei.f)
|
||||
{
|
||||
he.FlipE();
|
||||
if (he.IsBorder())
|
||||
{
|
||||
inc=6;
|
||||
break;
|
||||
}
|
||||
he.NextF();
|
||||
inc++;
|
||||
}
|
||||
if (inc!=6)
|
||||
Regular=false;
|
||||
if (inc!=6 && inc!=5)
|
||||
Semiregular=false;
|
||||
f->V(j)->SetS();
|
||||
|
||||
}
|
||||
else
|
||||
f->V(j)->SetS();
|
||||
}
|
||||
if (Semiregular==false)
|
||||
break;
|
||||
|
||||
}
|
||||
|
||||
if (Regular)
|
||||
{
|
||||
fprintf(index, "<p> Type of Mesh: REGULAR</p>");
|
||||
printf("\t Type of Mesh: REGULAR\n");
|
||||
}
|
||||
else if (Semiregular)
|
||||
{
|
||||
fprintf(index, "<p> Type of Mesh: SEMIREGULAR</p>");
|
||||
printf("\t Type of Mesh: SEMIREGULAR\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Type of Mesh: IRREGULAR</p>");
|
||||
printf("\t Type of Mesh: IRREGULAR\n");
|
||||
}
|
||||
// ORIENTABLE E ORIENTED MESH
|
||||
|
||||
bool Orientable=true;
|
||||
bool Oriented=true;
|
||||
if (!Manifold)
|
||||
{
|
||||
fprintf(index, "<p> Orientable Mesh: NO</p>");
|
||||
printf( "\t Orientable Mesh: NO\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
(*f).ClearS();
|
||||
(*f).ClearUserBit(0);
|
||||
}
|
||||
g=m.face.begin(); f=g;
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
if (!(*f).IsS())
|
||||
{
|
||||
(*f).SetS();
|
||||
sf.push(f);
|
||||
|
||||
while (!sf.empty())
|
||||
{
|
||||
g=sf.top();
|
||||
sf.pop();
|
||||
for(j=0;j<3;++j)
|
||||
{
|
||||
if( !(*g).IsBorder(j) )
|
||||
{
|
||||
he.Set(&(*g),0,g->V(0));
|
||||
l=he.f->FFp(j);
|
||||
he.Set(&(*g),j,g->V(j));
|
||||
hei.Set(he.f->FFp(j),he.f->FFi(j), (he.f->FFp(j))->V(he.f->FFi(j)));
|
||||
if( !(*g).IsUserBit(0) )
|
||||
{
|
||||
if (he.v!=hei.v) // bene
|
||||
{
|
||||
if ((*l).IsS() && (*l).IsUserBit(0))
|
||||
{
|
||||
Orientable=false;
|
||||
break;
|
||||
}
|
||||
else if (!(*l).IsS())
|
||||
{
|
||||
(*l).SetS();
|
||||
sf.push(l);
|
||||
}
|
||||
}
|
||||
else if (!(*l).IsS())
|
||||
{
|
||||
Oriented=false;
|
||||
(*l).SetS();
|
||||
(*l).SetUserBit(0);
|
||||
sf.push(l);
|
||||
}
|
||||
else if ((*l).IsS() && !(*l).IsUserBit(0))
|
||||
{
|
||||
Orientable=false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
else if (he.v==hei.v) // bene
|
||||
{
|
||||
if ((*l).IsS() && (*l).IsUserBit(0))
|
||||
{
|
||||
Orientable=false;
|
||||
break;
|
||||
}
|
||||
else if (!(*l).IsS())
|
||||
{
|
||||
(*l).SetS();
|
||||
sf.push(l);
|
||||
}
|
||||
}
|
||||
else if (!(*l).IsS())
|
||||
{
|
||||
Oriented=false;
|
||||
(*l).SetS();
|
||||
(*l).SetUserBit(0);
|
||||
sf.push(l);
|
||||
}
|
||||
else if ((*l).IsS() && !(*l).IsUserBit(0))
|
||||
{
|
||||
Orientable=false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!Orientable)
|
||||
break;
|
||||
}
|
||||
if (Orientable)
|
||||
{
|
||||
fprintf(index, "<p> Orientable Mesh: YES</p>");
|
||||
printf( "\t Orientable Mesh: YES\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Orientable Mesh: NO</p>");
|
||||
printf( "\t Orientable Mesh: NO\n");
|
||||
}
|
||||
}
|
||||
if (Oriented && Manifold)
|
||||
{
|
||||
fprintf(index, "<p> Oriented Mesh: YES</p>");
|
||||
printf( "\t Oriented Mesh: YES\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Oriented Mesh: NO</p>");
|
||||
printf( "\t Oriented Mesh: NO\n");
|
||||
}
|
||||
int dv = DuplicateVertex(m);
|
||||
if(dv>0)
|
||||
{
|
||||
fprintf(index, "<p> Duplicated vertices: %d</p>", dv);
|
||||
printf( "\t Duplicated vertices: %d\n",dv);
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Duplicated vertices: NO</p>");
|
||||
printf( "\t Duplicated vertices: NO\n");
|
||||
}
|
||||
// SELF INTERSECTION
|
||||
|
||||
if (m.fn<300000)
|
||||
{
|
||||
bool SelfInt=false;
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
{
|
||||
for(g=++f , f--;g!=m.face.end();++g)
|
||||
{
|
||||
if ((*f).FFp(0)!=&(*g) && (*f).FFp(1)!=&(*g) && (*f).FFp(2)!=&(*g) &&
|
||||
f->V(0)!=g->V(0) && f->V(0)!=g->V(1) && f->V(0)!=g->V(2) &&
|
||||
f->V(1)!=g->V(0) && f->V(1)!=g->V(1) && f->V(1)!=g->V(2) &&
|
||||
f->V(2)!=g->V(0) && f->V(2)!=g->V(1) && f->V(2)!=g->V(2))
|
||||
{
|
||||
if (NoDivTriTriIsect(f->V(0)->P(), f->V(1)->P(), f->V(2)->P(),g->V(0)->P(), g->V(1)->P(), g->V(2)->P()) )
|
||||
SelfInt=true;
|
||||
}
|
||||
}
|
||||
if (SelfInt)
|
||||
break;
|
||||
}
|
||||
if (SelfInt)
|
||||
{
|
||||
fprintf(index, "<p> Self Intersection: YES</p>");
|
||||
printf( "\t Self Intersection: YES\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
fprintf(index, "<p> Self Intersection: NO</p>");
|
||||
printf( "\t Self Intersection: NO\n");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
fclose(index);
|
||||
}
|
||||
|
||||
|
|
@ -1,58 +0,0 @@
|
|||
|
||||
VCGLib http://www.vcglib.net o o
|
||||
Visual and Computer Graphics Library o o
|
||||
_ O _
|
||||
Copyright(C) 2004-2005 \/)\/
|
||||
Visual Computing Lab http://vcg.isti.cnr.it /\/|
|
||||
ISTI - Italian National Research Council |
|
||||
\
|
||||
TriMeshInfo 1.01 14/02/2005
|
||||
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.
|
||||
|
||||
--- Synopsis ---
|
||||
|
||||
TriMeshInfo is a tool designed to inspect 3D models and retrieve all the
|
||||
topological related information. It can be used to automate the process
|
||||
of decoding 3D mesh inherent properties and ease data classification
|
||||
and retrieval.
|
||||
|
||||
|
||||
For each analyzed dataset the following information are extracted:
|
||||
|
||||
* Number of Vertices (Unreferenced vertices are listed separately)
|
||||
* Number of Faces
|
||||
* Number of Edges
|
||||
* Number of Connected Components
|
||||
* Number of Boundaries
|
||||
* Number of Isolated Vertices (i.e. Unreferenced)
|
||||
* Manifold
|
||||
* Volume (Computed only for Closed Manifold Datasets)
|
||||
* Color (Computed only if the information is embedded in the model)
|
||||
* Genus (Computed only for Manifold Datasets)
|
||||
* Orientability
|
||||
* Orientation
|
||||
* Regularity (We consider as regular those meshes generated through
|
||||
regular subdivision. Each non boundary vertex of a regular mesh has
|
||||
6 incident edges, if there are only 5 incident edges the mesh is said to be
|
||||
semi-regular, irregular in all other cases)
|
||||
* Number of Duplicated Vertices
|
||||
* Self-Intersection (Currently computed only for Datasets with less than 3M faces)
|
||||
|
||||
The application has no graphical interface but works as the "Metro" tool on command line.
|
||||
The application works under both Windows and Linux/Unix platforms.
|
||||
|
||||
TriMeshInfo is written in C++ and makes use of the VCL library.
|
||||
The tool supports two file formats ply and off (as described in http://www.geomview.org/docs/html/geomview_41.html#SEC44) .
|
||||
|
|
@ -1,17 +0,0 @@
|
|||
//{{NO_DEPENDENCIES}}
|
||||
// Microsoft Visual C++ generated include file.
|
||||
// Used by trimeshinfo.rc
|
||||
//
|
||||
#define IDI_ICON1 112
|
||||
#define IDI_ICON2 113
|
||||
|
||||
// Next default values for new objects
|
||||
//
|
||||
#ifdef APSTUDIO_INVOKED
|
||||
#ifndef APSTUDIO_READONLY_SYMBOLS
|
||||
#define _APS_NEXT_RESOURCE_VALUE 114
|
||||
#define _APS_NEXT_COMMAND_VALUE 40001
|
||||
#define _APS_NEXT_CONTROL_VALUE 1001
|
||||
#define _APS_NEXT_SYMED_VALUE 101
|
||||
#endif
|
||||
#endif
|
||||
Binary file not shown.
Binary file not shown.
|
|
@ -1,11 +0,0 @@
|
|||
<p>Mesh info: C:\sf\apps\trimeshinfo\trimeshinfo1.01\trimeshinfosample\kleine.ply </p>
|
||||
|
||||
|
||||
<p>GENERAL INFO </p>
|
||||
|
||||
<p>Number of vertices: 255 </p>
|
||||
<p>Number of faces: 520 </p>
|
||||
<p> Manifold: NO </p><p>Number of edges: 776 </p>
|
||||
<p>Number of degenerated faces: 0 </p>
|
||||
<p>Number of unreferenced vertices: 0</p>
|
||||
<p> Number of border edges: 0 </p><p> Number of connected components: 1 </p><p> Type of Mesh: IRREGULAR</p><p> Orientable Mesh: NO</p><p> Oriented Mesh: NO</p><p> Duplicated vertices: NO</p><p> Self Intersection: NO</p>
|
||||
Binary file not shown.
|
|
@ -1,13 +0,0 @@
|
|||
<p>Mesh info: C:\sf\apps\trimeshinfo\trimeshinfo1.01\trimeshinfosample\knot_orig.ply </p>
|
||||
|
||||
|
||||
<p>GENERAL INFO </p>
|
||||
|
||||
<p>Number of vertices: 12800 </p>
|
||||
<p>Number of faces: 25600 </p>
|
||||
<p> Manifold: YES </p><p>Number of edges: 38400 </p>
|
||||
<p>Number of degenerated faces: 0 </p>
|
||||
<p>Number of unreferenced vertices: 0</p>
|
||||
<p> Number of holes: 0 </p>
|
||||
<p> Number of border edges: 0 </p><p> Number of connected components: 1 </p><p> Genus: 1 </p>
|
||||
<p> Type of Mesh: REGULAR</p><p> Orientable Mesh: YES</p><p> Oriented Mesh: YES</p><p> Duplicated vertices: NO</p><p> Self Intersection: NO</p>
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -1,13 +0,0 @@
|
|||
<p>Mesh info: C:\sf\apps\trimeshinfo\trimeshinfo1.01\trimeshinfosample\moebius_big.ply </p>
|
||||
|
||||
|
||||
<p>GENERAL INFO </p>
|
||||
|
||||
<p>Number of vertices: 320 </p>
|
||||
<p>Number of faces: 480 </p>
|
||||
<p> Manifold: YES </p><p>Number of edges: 640 </p>
|
||||
<p>Number of degenerated faces: 0 </p>
|
||||
<p>Number of unreferenced vertices: 0</p>
|
||||
<p> Number of holes: 0 </p>
|
||||
<p> Number of border edges: 160 </p><p> Number of connected components: 1 </p><p> Genus: 1 </p>
|
||||
<p> Type of Mesh: IRREGULAR</p><p> Orientable Mesh: NO</p><p> Oriented Mesh: NO</p><p> Duplicated vertices: NO</p><p> Self Intersection: NO</p>
|
||||
|
|
@ -1,15 +0,0 @@
|
|||
This directory contains six 3d models that can be used to test trimeshinfo.
|
||||
The models represent a toroidal knot at two different level of details:
|
||||
|
||||
- knot_orig.ply 12800 vertexes, 25600 triangles: the original high resolution mesh
|
||||
- knot_subsampled.ply 800 vertexes, 1600 triangles: a low res model obtained by simple uniform subsampling
|
||||
- knot_vcg_simplified.ply 800 vertexes, 1600 triangles: a low res model obtained by our library simplification code
|
||||
|
||||
a low resolution model of the Kleine bottle:
|
||||
|
||||
- kleine.ply 255 vertexes, 520 triangles
|
||||
|
||||
two low resolution models of the moebius strip:
|
||||
|
||||
- moebius.ply 80 vertexes, 160 triangles
|
||||
- moebius_big.ply 320 vertexes, 480 triangles
|
||||
|
|
@ -1,54 +0,0 @@
|
|||
|
||||
VCGLib http://www.vcglib.net o o
|
||||
Visual and Computer Graphics Library o o
|
||||
_ O _
|
||||
Copyright(C) 2004-2005 \/)\/
|
||||
Visual Computing Lab http://vcg.isti.cnr.it /\/|
|
||||
ISTI - Italian National Research Council |
|
||||
\
|
||||
TriMeshInfo 1.0 21/09/2004
|
||||
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.
|
||||
|
||||
--- Synopsis ---
|
||||
|
||||
TriMeshInfo is a tool designed to inspect 3D models and retrieve all the
|
||||
topological related information. It can be used to automate the process
|
||||
of decoding 3D mesh inherent properties and ease data classification
|
||||
and retrieval.
|
||||
|
||||
|
||||
For each analyzed dataset the following information are extracted:
|
||||
|
||||
* Number of Vertices (Unreferenced vertices are listed separately)
|
||||
* Number of Faces
|
||||
* Number of Edges
|
||||
* Number of Connected Components
|
||||
* Number of Boundaries
|
||||
* Number of Isolated Vertices (i.e. Unreferenced)
|
||||
* Manifold
|
||||
* Genus (Computed only for Manifold Datasets)
|
||||
* Self-Intersection (Currently computed only for Datasets with less than 3M faces)
|
||||
* Orientability
|
||||
* Orientation
|
||||
* Regularity (We consider as regular those meshes generated through
|
||||
regular subdivision. Each non boundary vertex of a regular mesh has
|
||||
6 incident edges, if there are only 5 incident edges the mesh is said to be
|
||||
semi-regular, irregular in all other cases)
|
||||
|
||||
The application has no graphical interface but works as the "Metro" tool on command line.
|
||||
|
||||
TriMeshInfo is written in C++ and makes use of the VCL library.
|
||||
The tool supports two file formats ply and off (as described in http://www.geomview.org/docs/html/geomview_41.html#SEC44) .
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -1,19 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 6
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 3
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
-1 4 0
|
||||
0 4 0
|
||||
1 4 0
|
||||
0 6 0
|
||||
3 0 3 2
|
||||
3 1 4 3
|
||||
3 2 4 5
|
||||
|
|
@ -1,19 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 6
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 3
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
-1 4 0
|
||||
0 3.5 0
|
||||
1 4 0
|
||||
0 6 0
|
||||
3 0 3 2
|
||||
3 1 4 3
|
||||
3 2 4 5
|
||||
|
|
@ -1,19 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 6
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 3
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
-1 4 0
|
||||
0 4.01 0
|
||||
1 4 0
|
||||
0 6 0
|
||||
3 0 3 2
|
||||
3 1 4 3
|
||||
3 2 4 5
|
||||
|
|
@ -1,50 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 19
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 20
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
-1 1 0
|
||||
0 1 0
|
||||
1 1 0
|
||||
-2 2 0
|
||||
-1 2 0
|
||||
1 2 0
|
||||
2 2 0
|
||||
-1 3 0
|
||||
0 3 0
|
||||
1 3 0
|
||||
-2 4 0
|
||||
-1 4 0
|
||||
1 4 0
|
||||
2 4 0
|
||||
-1 5 0
|
||||
0 5 0
|
||||
1 5 0
|
||||
0 6 0
|
||||
3 0 2 1
|
||||
3 0 3 2
|
||||
3 1 5 4
|
||||
3 2 5 1
|
||||
3 3 6 2
|
||||
3 3 7 6
|
||||
3 5 8 4
|
||||
3 5 9 8
|
||||
3 6 10 9
|
||||
3 7 10 6
|
||||
3 8 12 11
|
||||
3 9 12 8
|
||||
3 10 13 9
|
||||
3 10 14 13
|
||||
3 12 15 11
|
||||
3 12 16 15
|
||||
3 13 17 16
|
||||
3 14 17 13
|
||||
3 16 18 15
|
||||
3 17 18 16
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,24 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 10
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 4
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
1.05 0.05 1
|
||||
1.05 1.05 2
|
||||
0.05 1.05 1
|
||||
0 0 0
|
||||
1 0 1
|
||||
0 1 1
|
||||
2 2 2
|
||||
2 1 1
|
||||
3 1 2
|
||||
3 1 0
|
||||
3 0 1 2
|
||||
3 3 4 5
|
||||
3 6 7 8
|
||||
3 8 7 9
|
||||
|
|
@ -1,44 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 16
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 18
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
-0.5 1 0
|
||||
0.5 1 0
|
||||
-1 2 0
|
||||
0 2 0
|
||||
1 2 0
|
||||
-1.5 3 0
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
1.5 3 0
|
||||
-1 4 0
|
||||
0 4 0
|
||||
1 4 0
|
||||
-0.5 5 0
|
||||
0.5 5 0
|
||||
0 6 0
|
||||
3 0 2 1
|
||||
3 1 4 3
|
||||
3 1 2 4
|
||||
3 2 5 4
|
||||
3 3 7 6
|
||||
3 3 4 7
|
||||
3 4 8 7
|
||||
3 4 5 8
|
||||
3 5 9 8
|
||||
3 6 7 10
|
||||
3 7 11 10
|
||||
3 7 8 11
|
||||
3 8 12 11
|
||||
3 8 9 12
|
||||
3 10 11 13
|
||||
3 11 14 13
|
||||
3 11 12 14
|
||||
3 13 14 15
|
||||
|
|
@ -1,39 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 14
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 15
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
-0.5 1 0
|
||||
0.5 1 0
|
||||
-1 2 0
|
||||
0 2 0
|
||||
1 2 0
|
||||
-1.5 3 0
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
1.5 3 0
|
||||
-1 4 0
|
||||
0 4 0
|
||||
1 4 0
|
||||
0 6 0
|
||||
3 0 2 1
|
||||
3 1 4 3
|
||||
3 1 2 4
|
||||
3 2 5 4
|
||||
3 3 7 6
|
||||
3 3 4 7
|
||||
3 4 8 7
|
||||
3 4 5 8
|
||||
3 5 9 8
|
||||
3 6 7 10
|
||||
3 7 11 10
|
||||
3 7 8 11
|
||||
3 8 12 11
|
||||
3 8 9 12
|
||||
3 10 12 13
|
||||
|
|
@ -1,39 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 14
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 15
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
-0.5 1 0
|
||||
0.5 1 0
|
||||
-1 2 0
|
||||
0 2 0
|
||||
1 2 0
|
||||
-1.5 3 0
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
1.5 3 0
|
||||
-1 4 0
|
||||
0 3.5 0
|
||||
1 4 0
|
||||
0 6 0
|
||||
3 0 2 1
|
||||
3 1 4 3
|
||||
3 1 2 4
|
||||
3 2 5 4
|
||||
3 3 7 6
|
||||
3 3 4 7
|
||||
3 4 8 7
|
||||
3 4 5 8
|
||||
3 5 9 8
|
||||
3 6 7 10
|
||||
3 7 11 10
|
||||
3 7 8 11
|
||||
3 8 12 11
|
||||
3 8 9 12
|
||||
3 10 12 13
|
||||
|
|
@ -1,42 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 16
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 16
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
-0.5 1 0
|
||||
0.5 1 0
|
||||
-1 2 0
|
||||
0 2 0
|
||||
1 2 0
|
||||
-1.5 3 0
|
||||
-0.5 3 0
|
||||
0.5 3 0
|
||||
1.5 3 0
|
||||
-1 4 0
|
||||
0 4 0
|
||||
1 4 0
|
||||
-0.5 5 0
|
||||
0.5 5 0
|
||||
0 6 0
|
||||
3 0 2 1
|
||||
3 1 4 3
|
||||
3 1 2 4
|
||||
3 2 5 4
|
||||
3 3 7 6
|
||||
3 3 4 7
|
||||
3 4 5 8
|
||||
3 5 9 8
|
||||
3 6 7 10
|
||||
3 7 11 10
|
||||
3 8 12 11
|
||||
3 8 9 12
|
||||
3 10 11 13
|
||||
3 11 14 13
|
||||
3 11 12 14
|
||||
3 13 14 15
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -1,26 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 11
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 5
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
1.05 0.05 1
|
||||
1.05 1.05 2
|
||||
0.05 1.05 1
|
||||
0 0 0
|
||||
1 0 1
|
||||
0 1 1
|
||||
2 2 2
|
||||
2 1 1
|
||||
3 1 2
|
||||
3 1 0
|
||||
1.5 1 2
|
||||
3 0 1 2
|
||||
3 3 4 5
|
||||
3 6 7 8
|
||||
3 8 7 9
|
||||
3 8 10 7
|
||||
|
|
@ -1,14 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 3
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 1
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
0 0 0
|
||||
1 0 1
|
||||
0 1 1
|
||||
3 0 1 2
|
||||
|
|
@ -1,15 +0,0 @@
|
|||
This directory contains six 3d models that can be used to test trimeshinfo.
|
||||
The models represent a toroidal knot at two different level of details:
|
||||
|
||||
- knot_orig.ply 12800 vertexes, 25600 triangles: the original high resolution mesh
|
||||
- knot_subsampled.ply 800 vertexes, 1600 triangles: a low res model obtained by simple uniform subsampling
|
||||
- knot_vcg_simplified.ply 800 vertexes, 1600 triangles: a low res model obtained by our library simplification code
|
||||
|
||||
a low resolution model of the Kleine bottle:
|
||||
|
||||
- kleine.ply 255 vertexes, 520 triangles
|
||||
|
||||
two low resolution models of the moebius strip:
|
||||
|
||||
- moebius.ply 80 vertexes, 160 triangles
|
||||
- moebius_big.ply 320 vertexes, 480 triangles
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -1,22 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 9
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 3
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
1.05 0.05 1
|
||||
1.05 1.05 2
|
||||
0.05 1.05 1
|
||||
0 0 0
|
||||
1 0 1
|
||||
0 1 1
|
||||
2 2 2
|
||||
2 1 1
|
||||
3 1 2
|
||||
3 0 1 2
|
||||
3 3 4 5
|
||||
3 6 7 8
|
||||
|
|
@ -1,18 +0,0 @@
|
|||
ply
|
||||
format ascii 1.0
|
||||
comment VCGLIB generated
|
||||
element vertex 6
|
||||
property float x
|
||||
property float y
|
||||
property float z
|
||||
element face 2
|
||||
property list uchar int vertex_indices
|
||||
end_header
|
||||
1.05 0.05 1
|
||||
1.05 1.05 2
|
||||
0.05 1.05 1
|
||||
0 0 0
|
||||
1 0 1
|
||||
0 1 1
|
||||
3 0 1 2
|
||||
3 3 4 5
|
||||
Loading…
Reference in New Issue