vcglib/apps/nexus/pvoronoi.cpp

191 lines
5.5 KiB
C++
Raw Normal View History

2004-06-24 16:32:45 +02:00
/****************************************************************************
* 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 $
2004-07-01 23:35:34 +02:00
Revision 1.1 2004/06/24 14:32:45 ponchio
Moved from wrap/nexus
2004-06-24 16:32:45 +02:00
Revision 1.2 2004/06/24 14:19:20 ponchio
Debugged
Revision 1.1 2004/06/23 17:17:46 ponchio
Created
****************************************************************************/
#pragma warning(disable:4786 4804 4244 4018 4267 4311)
#include <stdio.h>
#include <iostream>
#include "pvoronoi.h"
using namespace std;
using namespace vcg;
using namespace nxs;
bool Seed::Dist(const Point3f &point, float &mindist,
Point3f &res) {
float newdist = Distance(p, point);
if(newdist < mindist) {
mindist = newdist;
res = p;
return true;
} else
return false;
}
2004-07-01 23:35:34 +02:00
VoronoiPartition::Key VoronoiPartition::Add(const vcg::Point3f &p,
float weight) {
2004-06-24 16:32:45 +02:00
Seed ns(p,weight);
all_seeds.push_back(ns);
seedBuf.push_back(p);
if(seedBuf.size() >= MAX_BUF) {
for(unsigned int i = 0; i < seedBuf.size(); ++i)
ug_seeds.push_back(seedBuf[i]);
seedBuf.clear();
ug.Set(ug_seeds);
}
2004-07-01 23:35:34 +02:00
return (Key)(size());
2004-06-24 16:32:45 +02:00
}
2004-07-01 23:35:34 +02:00
float VoronoiPartition::Closest(const vcg::Point3f &p,
VoronoiPartition::Key &target, float radius) {
2004-06-24 16:32:45 +02:00
Point3f res;
float mindist = 1e20;
target = -1;
if(ug_seeds.size()) {
Seed *nsp = ug.GetClosest(p, mindist, res);
if(nsp) {
target = nsp-&*ug_seeds.begin();
}
}
for(unsigned int i=0;i<seedBuf.size();++i) {
float dist = seedBuf[i].Dist(p);
if(mindist > dist) {
target=ug_seeds.size()+i;
mindist=dist;
}
}
//assert(target >=0 );
//assert (target < size()+seedBuf.size());
return mindist;
}
void VoronoiPartition::iterator::operator++() {
++seed;
}
const VoronoiPartition::Key VoronoiPartition::iterator::operator*() {
return seed;
}
bool VoronoiPartition::iterator::operator==(const VoronoiPartition::iterator &key) {
return key.seed == seed;
}
bool VoronoiPartition::iterator::operator!=(const VoronoiPartition::iterator &key) {
return key.seed != seed;
}
VoronoiPartition::iterator VoronoiPartition::begin() {
iterator i;
i.seed = 0;
return i;
}
VoronoiPartition::iterator VoronoiPartition::end() {
iterator i;
i.seed = size();
return i;
}
int VoronoiPartition::size() {
return all_seeds.size();
}
void VoronoiPartition::clear() {
all_seeds.clear();
ug_seeds.clear();
seedBuf.clear();
}
unsigned int VoronoiPartition::count(Key key) {
return key > 0 && key < size();
}
Seed &VoronoiPartition::operator[](Key key) {
2004-07-01 23:35:34 +02:00
assert((unsigned int)key < all_seeds.size());
2004-06-24 16:32:45 +02:00
return all_seeds[key];
}
VoronoiPartition::Key VoronoiPartition::Locate(const vcg::Point3f &p) {
int target;
Closest(p, target);
assert(target != -1);
return target;
}
float VoronoiPartition::Priority(const vcg::Point3f &p, Key key) {
Seed &seed = all_seeds[key];
return seed.Dist(p);
}
bool VoronoiPartition::Save(const std::string &file) {
FILE *fp = fopen(file.c_str(), "wb+");
if(!fp) return false;
Save(fp);
fclose(fp);
return true;
}
bool VoronoiPartition::Load(const std::string &file) {
FILE *fp = fopen(file.c_str(), "rb");
if(!fp) return false;
Load(fp);
fclose(fp);
return true;
}
unsigned int VoronoiPartition::Save(FILE *fp) {
fwrite(&bbox, sizeof(Box3f), 1, fp);
int n = all_seeds.size();
fwrite(&n, sizeof(int), 1, fp);
fwrite(&all_seeds[0], sizeof(Seed), all_seeds.size(), fp);
return sizeof(Box3f) + sizeof(int) + sizeof(Seed) * all_seeds.size();
}
unsigned int VoronoiPartition::Load(FILE *fp) {
clear();
fread(&bbox, sizeof(Box3f), 1, fp);
int n;
fread(&n, sizeof(int), 1, fp);
all_seeds.resize(n);
fread(&all_seeds[0], sizeof(Seed), all_seeds.size(), fp);
ug_seeds.resize(n);
for(int i = 0; i < n; i++)
ug_seeds[i] = all_seeds[i];
ug.SetBBox(bbox);
ug.Set(ug_seeds);
return sizeof(Box3f) + sizeof(int) + sizeof(Seed) * all_seeds.size();
}