1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464
|
/****************************************************************************
* 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.2 2005/05/09 12:29:55 callieri
added line cleaning to eliminate all separators, added a rough triangulation scheme.
Revision 1.1 2005/05/06 13:58:26 callieri
First working version (callieri)
****************************************************************************/
#ifndef __VCGLIB_IMPORT_RAW
#define __VCGLIB_IMPORT_RAW
#include <stdio.h>
#include <fstream>
#include <iostream>
namespace vcg {
namespace tri {
namespace io {
/**
This class encapsulate a filter for importing raw format pointcloud.
there exists many raw formats. each one with a particular sintax even if they only contains
*/
template <class MESH_TYPE>
class ImporterRAW
{
public:
typedef typename MESH_TYPE::VertexPointer VertexPointer;
typedef typename MESH_TYPE::ScalarType ScalarType;
typedef typename MESH_TYPE::VertexType VertexType;
typedef typename MESH_TYPE::FaceType FaceType;
typedef typename MESH_TYPE::VertexIterator VertexIterator;
typedef typename MESH_TYPE::FaceIterator FaceIterator;
// max token number
#define RAW_MAX_TOKEN_LINE_DESCRIPTOR 32
enum RAWError {
E_NOERROR, // 0
// Error open
E_CANTOPEN, // 1
E_UNESPECTEDEOF, // 2
// error line descriptor
E_INVALIDLINEDESC, // 3
// error line parsing
E_LINEERROR, // 4
// wrong number of points
E_WRONGPOINTNUM // 5
};
static const char *ErrorMsg(int error)
{
static const char * raw_error_msg[] =
{
"No errors",
"Can't open file",
"Premature End of file",
"Invalid line Descriptor",
"Error parsing a line",
"Point number different from expected"
};
if(error>2 || error<0) return "Unknown error";
else return stl_error_msg[error];
};
// line format is a string describing which data is stored for every data line
// PX PY PZ posizione
// NX NY NZ normale
// CR CG CB colore
// RF riflettanza (qualita')
//
// the string is parsed to know how many value are contained in each line
// and which is the order. the result is a number (how many) and a vector
// describing the order
//
//
// during reading a data structure is used to store intermediate values
// it is basically an array of float
//
// float linebuffer[]
//[0][1][2][3][4][5][6][7][8][9]
// p p p n n n c c c r
// x y z x y z r g b f
//
// given the number of tokens and the order vector it is possible to scan a line using the command
//
// for(...n 0->tokennumber...)
// fscanf(fp,"%f", &linebuffer[tokenorder[n]])
static int Parselinedescription(const char * linedesc, int &tokennumber, int *order)
{
int ii;
char tok[3];
int index;
// controllo lunghezza
// se non e' multiplo di 3 allora e' errato
int len = strlen(linedesc) + 1;
if(len%3 != 0)
return E_INVALIDLINEDESC;
index=0;
tok[2] = '\0';
tokennumber = 0;
for(ii=0; ii<RAW_MAX_TOKEN_LINE_DESCRIPTOR; ii++)
order[ii] = -1;
while(index <= (len-3))
{
tok[0] = linedesc[index ];
tok[1] = linedesc[index+1];
if(strcmp(tok,"PX") == 0) // pos x
{order[tokennumber] = 0; tokennumber++;}
else if (strcmp(tok,"PY") == 0) // pos y
{order[tokennumber] = 1; tokennumber++;}
else if (strcmp(tok,"PZ") == 0) // pos z
{order[tokennumber] = 2; tokennumber++;}
else if (strcmp(tok,"NX") == 0) // norm x
{order[tokennumber] = 3; tokennumber++;}
else if (strcmp(tok,"NY") == 0) // norm y
{order[tokennumber] = 4; tokennumber++;}
else if (strcmp(tok,"NZ") == 0) // norm z
{order[tokennumber] = 5; tokennumber++;}
else if (strcmp(tok,"CR") == 0) // col r
{order[tokennumber] = 6; tokennumber++;}
else if (strcmp(tok,"CG") == 0) // col g
{order[tokennumber] = 7; tokennumber++;}
else if (strcmp(tok,"CB") == 0) // col b
{order[tokennumber] = 8; tokennumber++;}
else if (strcmp(tok,"RF") == 0) // rifl
{order[tokennumber] = 9; tokennumber++;}
else // nessuno dei suddetti... errore
{ return E_INVALIDLINEDESC; }
index +=3;
}
return E_NOERROR;
}
// function to skip a line
static void Skipline(FILE *fp)
{
char buf;
fread(&(buf),sizeof(char),1,fp);
while(buf != '\n')
fread(&(buf),sizeof(char),1,fp);
}
// function to parse the line read from the raw file
// all characters besides numerals,dot,minus,plus
// if e is found between numbers it's ketpt (12e4)
static int Parseline(int tokennumber, int *tokenorder, char *rawline, float *linebuffer)
{
int linelen;
int ii;
bool change;
int foundtok;
// length
linelen = strlen(rawline);
// cleaning the line
for(ii=0;ii<(linelen-1);)
{
change = true;
if(isdigit(rawline[ii])) // is a number
change = false;
else if(rawline[ii]==' ') // is a space
change = false;
else if((rawline[ii]=='-') || (rawline[ii]=='+') || (rawline[ii]=='-') || (rawline[ii]=='.')) // is + - .
change = false;
else if(rawline[ii]=='e') // is e... is perhaps an exponential ?
{
if((ii>0) || (ii<(linelen-2))) // if it's at the begin or the end of line, it's not an exponential
if(isdigit(rawline[ii-1])) // a number before it
if(isdigit(rawline[ii+1]) || (rawline[ii+1]=='+') || (rawline[ii+1]=='-')) // after it a number a plus or a minus
change = false;
}
if(change)
rawline[ii++] = ' '; // then change it to ' '
else
ii++;
}
rawline[linelen] = '\0';
// now parsing the line
foundtok = 0;
ii = 0;
while((foundtok<tokennumber)&&(ii<linelen))
{
//find the next token begin
while(rawline[ii] == ' ')
ii++;
foundtok++;
sscanf(&(rawline[ii]),"%f", &(linebuffer[tokenorder[foundtok-1]]));
// going after the token
while((rawline[ii] != ' ')&&(rawline[ii] != '\0'))
ii++;
}
if(foundtok<tokennumber)
return E_LINEERROR;
else
return E_NOERROR;
}
static int fillHoles( MESH_TYPE &m, size_t rowCount, size_t colCount)
{
for (size_t i = 1; i<colCount-1; ++i)
for (size_t j = 1; j<rowCount-1; ++j)
{
size_t ind = (i) + ((j) * colCount);
size_t indL = (i-1) + ((j) * colCount);
size_t indR = (i+1) + ((j) * colCount);
size_t indT = (i) + ((j-1) * colCount);
size_t indB = (i) + ((j+1) * colCount);
if ((m.vert[ind].P() == vcg::Point3<MESH_TYPE::ScalarType>(0,0,0)) &&
(m.vert[indL].P() != vcg::Point3<MESH_TYPE::ScalarType>(0,0,0)) &&
(m.vert[indR].P() != vcg::Point3<MESH_TYPE::ScalarType>(0,0,0)) &&
(m.vert[indT].P() != vcg::Point3<MESH_TYPE::ScalarType>(0,0,0)) &&
(m.vert[indB].P() != vcg::Point3<MESH_TYPE::ScalarType>(0,0,0)) )
{
m.vert[ind].P() = ( m.vert[indL].P() + m.vert[indR].P() + m.vert[indT].P() + m.vert[indB].P() ) * 0.25;
}
}
//vcg::tri::io::ExporterPLY<MESH_TYPE>::Save( hm, "hole.ply" );
return 1;
}
/*!
* Standard call for reading a mesh
* \param m the destination mesh
* \param filename the name of the file to read from
* \param triangulate if true, the mesh will be triangulated, otherwise only points will be stored
* \param lineskip number of lines to be skipped at the begin of the file
* \return the operation result
*/
static int Open( MESH_TYPE &m, const char * filename, bool triangulate=false, int lineskip = 0, const char * linedesc = "PX PY PZ")
{
int ii;
int ret;
FILE *fp;
int rownumber;
int colnumber;
// line description
int tokennumber;
int tokenorder[RAW_MAX_TOKEN_LINE_DESCRIPTOR];
// line read from file, to be parsed
char rawline[512];
//line data buffer
float linebuffer[10];
// fill buffer with standard values
linebuffer[0] = linebuffer[1] = linebuffer[2] = 0.0;
linebuffer[3] = linebuffer[4] = linebuffer[5] = 1.0;
linebuffer[6] = 0.0; linebuffer[7] = 1.0; linebuffer[8] = 0.0;
linebuffer[9] = 1.0;
fp = fopen(filename, "r");
if(fp == NULL)
{
return E_CANTOPEN;
}
// skip initial lines
for(ii=0; ii<lineskip; ii++) Skipline(fp);
// in raw files with indication of rows and columns it's also possible to triangulate points
// after the skipped lines there should be the number of row and columns
if(triangulate)
{
fscanf(fp,"%i", &(rownumber));
fscanf(fp,"%i\n", &(colnumber));
}
// parsing line description
ret = Parselinedescription(linedesc, tokennumber, tokenorder);
if(ret)
return ret;
m.Clear();
m.vert.reserve( rownumber * colnumber );
int line = 0;
size_t rowCounter = 0;
size_t colCounter = 0;
while(!feof(fp))
{
/**/
//read a new line
ii=0;
memset( rawline, 0, 512);
fread(&(rawline[ii++]),sizeof(char),1,fp);
while( (rawline[ii-1] != '\n') && (ii<512) )
{
fread(&(rawline[ii++]),sizeof(char),1,fp);
}
rawline[ii-1] = '\0';
line++;
if(strlen(rawline) >0) // empty line, just skip
{
ret = Parseline(tokennumber, tokenorder, rawline, linebuffer);
if(ret)
return ret;
/*
// old code reading directly fom file stream
for(ii=0; ii<tokennumber; ii++)
fscanf(fp,"%f", &(linebuffer[tokenorder[ii]]));
*/
// new vertex
VertexType nv;
// store the position
nv.P()[0] = linebuffer[0];
nv.P()[1] = linebuffer[1];
nv.P()[2] = linebuffer[2];
// store the normal
if(HasPerVertexNormal(m))
{
nv.N()[0] = linebuffer[3];
nv.N()[1] = linebuffer[4];
nv.N()[2] = linebuffer[5];
}
// store the color
if(HasPerVertexColor(m))
{
nv.C()[0] = linebuffer[6];
nv.C()[1] = linebuffer[7];
nv.C()[2] = linebuffer[8];
}
// store the reflectance
if(m.HasPerVertexQuality())
{
nv.Q() = linebuffer[9];
}
m.vert.push_back(nv);
} // end if zero length
}
m.vn = m.vert.size();
if(triangulate) fillHoles(m, rownumber, colnumber);
// update model point number
// now generate the triangles
if(triangulate)
{
int rr,cc;
//if(m.vn != (rownumber * colnumber)) return E_WRONGPOINTNUM;
int trinum = (rownumber-1) * (colnumber-1) * 2;
FaceIterator fi=Allocator<MESH_TYPE>::AddFaces(m,trinum);
FaceIterator fi2 = fi;
m.fn = trinum;
for(cc=0; cc<colnumber-1; cc++)
for(rr=0; rr<rownumber-1; rr++)
{
// upper tri
(*fi).V(0) = &(m.vert[(cc+1) + ((rr ) * colnumber)]);
(*fi).V(1) = &(m.vert[(cc ) + ((rr ) * colnumber)]);
(*fi).V(2) = &(m.vert[(cc ) + ((rr+1) * colnumber)]);
fi++;
// lower tri
(*fi).V(0) = &(m.vert[(cc ) + ((rr+1) * colnumber)]);
(*fi).V(1) = &(m.vert[(cc+1) + ((rr+1) * colnumber)]);
(*fi).V(2) = &(m.vert[(cc+1) + ((rr ) * colnumber)]);
fi++;
}
// tag faux faces
if (m.HasPerFaceFlags()) {
for (; fi2!=m.face.end(); fi2++) {
(*fi2).SetF(2);
}
}
}
fclose(fp);
return E_NOERROR;
}
}; // end class
} // end Namespace tri
} // end Namespace io
} // end Namespace vcg
#endif
|