243 lines
7.3 KiB
C++
243 lines
7.3 KiB
C++
/****************************************************************************
|
|
* VCGLib o o *
|
|
* Visual and Computer Graphics Library o 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 *
|
|
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
|
* for more details. *
|
|
* *
|
|
****************************************************************************/
|
|
/****************************************************************************
|
|
History
|
|
|
|
$Log: not supported by cvs2svn $
|
|
Revision 1.4 2004/07/20 14:05:45 ponchio
|
|
Inserted report on progress.
|
|
|
|
Revision 1.3 2004/07/15 14:32:49 ponchio
|
|
Debug.
|
|
|
|
Revision 1.2 2004/07/05 15:49:39 ponchio
|
|
Windows (DevCpp, mingw) port.
|
|
|
|
Revision 1.1 2004/07/04 15:30:00 ponchio
|
|
Changed directory structure.
|
|
|
|
Revision 1.3 2004/07/02 17:42:43 ponchio
|
|
Debug.
|
|
|
|
Revision 1.2 2004/07/02 13:09:31 ponchio
|
|
Extensions changed.
|
|
|
|
Revision 1.1 2004/07/01 21:32:18 ponchio
|
|
Created
|
|
|
|
|
|
****************************************************************************/
|
|
|
|
#include <iostream>
|
|
#include "pchain.h"
|
|
#include "pvoronoi.h"
|
|
#include "vert_remap.h"
|
|
#include "crude.h"
|
|
#include "pintersect.h"
|
|
#include "report.h"
|
|
|
|
using namespace std;
|
|
using namespace nxs;
|
|
using namespace vcg;
|
|
|
|
|
|
int main(int argc, char *argv[]) {
|
|
if(argc < 3) {
|
|
cerr << "Usage: " << argv[0]
|
|
<< " <crude input> <output (remap and pchain)> "
|
|
"[patch_size] [threshold]\n\n";
|
|
cerr << "Patch size and treshold expressed int faces "
|
|
"and default to 1000 and 250\n";
|
|
return -1;
|
|
}
|
|
|
|
|
|
|
|
Crude crude;
|
|
if(!crude.Load(argv[1])) {
|
|
cerr << "Could not open crude input\n";
|
|
return -1;
|
|
}
|
|
|
|
string output = argv[2];
|
|
|
|
unsigned int target_size = 1000;
|
|
if(argc > 3)
|
|
target_size = atoi(argv[3]);
|
|
if(target_size <= 0) {
|
|
cerr << "Invalid patch_size: " << argv[3] << endl;
|
|
return -1;
|
|
}
|
|
|
|
unsigned int treshold = 250;
|
|
if(argc > 4)
|
|
treshold = atoi(argv[4]);
|
|
if(treshold <= 0) {
|
|
cerr << "Invalid patch_size: " << argv[4] << endl;
|
|
return -1;
|
|
}
|
|
|
|
cerr << "Verts: " << crude.Vertices() << endl;
|
|
cerr << "Faces: " << crude.Faces() << endl;
|
|
cerr << "Getting optimal radius...\n";
|
|
|
|
Report report;
|
|
report.Start((unsigned int)0, 0);
|
|
|
|
vector<unsigned int> target;
|
|
unsigned int patch_size = target_size;
|
|
for(patch_size = target_size; patch_size < crude.vert.Size(); patch_size *=2)
|
|
target.push_back(patch_size);
|
|
vector<float> radius;
|
|
radius = VoronoiPartition::OptimalRadii(crude.vert.Size(),
|
|
crude.vert.Begin(),
|
|
crude.vert.End(),
|
|
crude.GetBox(),
|
|
target);
|
|
// for(unsigned int i = 0; i < radius.size(); i++)
|
|
// cerr << "Radius: " << radius[i] << endl;
|
|
|
|
cerr << " ...done in " << report.Elapsed() << " secs\n";
|
|
|
|
assert(radius.size() > 1);
|
|
//TODO cosa succede se c'e' una sola patch?
|
|
|
|
PChain<VoronoiPartition> chain;
|
|
|
|
for(unsigned int i = 0; i < radius.size(); i++) {
|
|
VoronoiPartition part;
|
|
part.Init(crude.GetBox());
|
|
chain.levels.push_back(part);
|
|
}
|
|
report.Start(0, 0);
|
|
cerr << "Building voronoi partitions...";
|
|
|
|
//TODO move this part to pvoronoi (and create Crude::vert_iterator
|
|
VFile<Point3f>::iterator iter;
|
|
for(iter = crude.vert.Begin(); iter != crude.vert.End(); ++iter) {
|
|
Point3f &v = *iter;
|
|
VoronoiPartition::Key target;
|
|
float dist;
|
|
for(unsigned int i = 0; i < radius.size(); i++) {
|
|
VoronoiPartition &part = chain.levels[i];
|
|
dist = part.Closest(v, target);
|
|
if(dist >= radius[i] || dist == -1)
|
|
part.Add(v, radius[i]);
|
|
}
|
|
}
|
|
|
|
cerr << "...done in " << report.Elapsed() << " secs\n";
|
|
|
|
VFile<unsigned int> face_remap;
|
|
if(!face_remap.Create(output + ".rmf")) {
|
|
cerr << "Could not create remap files: " << output << ".frm\n";
|
|
return -1;
|
|
}
|
|
face_remap.Resize(crude.Faces());
|
|
|
|
|
|
PIntersect<VoronoiPartition> inter(&(chain.levels[0]), &(chain.levels[1]));
|
|
|
|
report.Start(crude.Faces(), 100000);
|
|
cerr << "Splitting faces... ";
|
|
|
|
Point3f bari;
|
|
for(unsigned int i = 0; i < crude.Faces(); i++) {
|
|
bari = crude.GetBari(i);
|
|
unsigned int patch = inter.Locate(bari);
|
|
face_remap[i] = patch;
|
|
report.Output(i);
|
|
}
|
|
|
|
cerr << "done in " << report.Elapsed() << " secs\n";
|
|
|
|
//TODO Prune inter to threshold and relocate faces
|
|
|
|
inter.Save(output);
|
|
|
|
VertRemap vert_remap;
|
|
if(!vert_remap.Create(output)) {
|
|
cerr << "Could not create remap files: " << output << ".rmv and .rmb\n";
|
|
return -1;
|
|
}
|
|
vert_remap.Resize(crude.vert.Size());
|
|
|
|
cerr << "Splitting vertices... ";
|
|
report.Start(crude.Faces(), 100000);
|
|
|
|
unsigned int totvert = 0;
|
|
for(unsigned int i = 0; i < crude.Faces(); i++) {
|
|
report.Output(i);
|
|
Crude::Face &face = crude.GetFace(i);
|
|
unsigned int patch = face_remap[i];
|
|
for(int k = 0; k < 3; k++) {
|
|
set<unsigned int> pp;
|
|
vert_remap.GetValues(face[k], pp);
|
|
if(!pp.count(patch))
|
|
totvert++;
|
|
vert_remap.Insert(face[k], patch);
|
|
}
|
|
}
|
|
cerr << "done in " << report.Elapsed() << " secs\n";
|
|
cerr << "Tot vertices: " << totvert << endl;
|
|
chain.Save(output);
|
|
|
|
for(unsigned int i = 0; i < vert_remap.all.Size(); i++) {
|
|
unsigned int patch = vert_remap.all[i];
|
|
if(patch == 0xffffffff) {
|
|
continue;
|
|
}
|
|
totvert--;
|
|
}
|
|
int totbord = 0;
|
|
VFile<MFHash::Bucket> &border = vert_remap.borders.buffer;
|
|
cerr << "Border space:" << border.Size() << endl;
|
|
for(unsigned int i = 0; i < border.Size(); i++) {
|
|
MFHash::Bucket &bucket = border[i];
|
|
if(bucket.key == 0xffffffff) continue;
|
|
totvert--;
|
|
totbord++;
|
|
}
|
|
cerr << "Borders: " << totbord << endl;
|
|
vert_remap.Close();
|
|
|
|
//DEBUG testing if vert_remap.borders works
|
|
|
|
/* for(unsigned int i = 0; i < crude.Faces(); i++) {
|
|
Crude::Face &face = crude.GetFace(i);
|
|
unsigned int patch = face_remap[i];
|
|
for(int k = 0; k < 3; k++) {
|
|
set<unsigned int> v;
|
|
vert_remap.GetValues(face[k], v);
|
|
assert(v.size() != 0);
|
|
if(!v.count(patch)) {
|
|
cerr << "count: " << v.size() << endl;
|
|
cerr << "patch " << patch << endl;
|
|
}
|
|
assert(v.count(patch));
|
|
}
|
|
}*/
|
|
|
|
return 0;
|
|
}
|