converted to library style (namespaces etc..)

This commit is contained in:
ganovelli 2004-05-10 13:14:28 +00:00
parent 30cac403d3
commit 63e0afc39e
1 changed files with 24 additions and 78 deletions

View File

@ -1,78 +1,24 @@
/**************************************************************************** /**************************************************************************** * VCGLib o o * * Visual and Computer Graphics Library o o * * _ O _ *
* VCGLib o o * * Copyright(C) 2004 \/)\/ * * 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 *
* Visual and Computer Graphics Library o o * * GNU General Public License (http://www.gnu.org/licenses/gpl.txt) * * for more details. * * * ****************************************************************************/
* _ O _ * /****************************************************************************
* Copyright(C) 2004 \/)\/ * History
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | * $Log: not supported by cvs2svn $
* \ *
* All rights reserved. * ****************************************************************************/ #ifndef __VCGLIB_IMPORTERSMF
* * #define __VCGLIB_IMPORTERSMF #include <map>
* 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 * namespace vcg {
* the Free Software Foundation; either version 2 of the License, or * namespace tri {
* (at your option) any later version. * namespace io {
* *
* This program is distributed in the hope that it will be useful, * template <class MESHTYPE>
* but WITHOUT ANY WARRANTY; without even the implied warranty of * int Load_Smf( MESHTYPE & m, const char * filename ) { typedef typename MESHTYPE::VertexPointer VertexPointer;
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * typedef typename MESHTYPE::VertexType VertexType;
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) * typedef typename MESHTYPE::FaceType FaceType;
* for more details. * typedef typename MESHTYPE::VertexIterator VertexIterator;
* * typedef typename MESHTYPE::FaceIterator FaceIterator;
****************************************************************************/ char buf[1024];
/** Function to load a Smf file FILE *fp; float x,y,z; bool one = true; std::map<int,VertexPointer> mv; fp = fopen(filename,"r"); if(!fp) return -1; VertexType v; v.Supervisor_Flags() = 0; FaceType f; f.Supervisor_Flags() = 0;
@param filename Name of Smf file while( fgets(buf,1024,fp) ) { char *vf, *comm_pt; if((comm_pt = strstr(buf,"#")) != NULL) *comm_pt = '\0'; if( (vf = strstr(buf,"v")) != NULL ) { sscanf(vf+1,"%f %f %f", &x, &y, &z); v.P()[0] = x; v.P()[1] = y; v.P()[2] = z; m.vert.push_back(v); } else if( (vf = strstr(buf,"f")) != NULL) { if(one) { VertexIterator vi; int ind; for(ind=1,vi=m.vert.begin(); vi!=m.vert.end(); ++vi,++ind) mv[ind]=&*vi; one = false; } int v1,v2,v3; sscanf(vf+1,"%d %d %d", &v1, &v2, &v3); f.V(0) = mv[v1]; f.V(1) = mv[v2]; f.V(2) = mv[v3]; m.face.push_back(f); } } m.vn = m.vert.size(); m.fn = m.face.size(); return 0; } };// end of io };// end of tri };// end of vcg #endif
*/
int Load_Smf( const char * filename )
{
char buf[1024];
FILE *fp;
float x,y,z;
bool one = true;
map<int,vertex_pointer> mv;
fp = fopen(filename,"r");
if(!fp) return -1;
vertex_type v;
v.Supervisor_Flags() = 0;
face_type f;
f.Supervisor_Flags() = 0;
while( fgets(buf,1024,fp) )
{
char *vf, *comm_pt;
if((comm_pt = strstr(buf,"#")) != NULL)
*comm_pt = '\0';
if( (vf = strstr(buf,"v")) != NULL )
{
sscanf(vf+1,"%f %f %f", &x, &y, &z);
v.P()[0] = x;
v.P()[1] = y;
v.P()[2] = z;
vert.push_back(v);
}
else if( (vf = strstr(buf,"f")) != NULL)
{
if(one)
{
vertex_iterator vi;
int ind;
for(ind=1,vi=vert.begin(); vi!=vert.end(); ++vi,++ind)
mv[ind]=&*vi;
one = false;
}
int v1,v2,v3;
sscanf(vf+1,"%d %d %d", &v1, &v2, &v3);
f.V(0) = mv[v1];
f.V(1) = mv[v2];
f.V(2) = mv[v3];
face.push_back(f);
}
}
vn = vert.size();
fn = face.size();
return 0;
}