100 lines
3.5 KiB
C++
100 lines
3.5 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 2005/02/21 17:55:49 ponchio
|
|
debug debug debug
|
|
|
|
Revision 1.3 2005/01/18 22:46:58 ponchio
|
|
Small changes.
|
|
|
|
Revision 1.2 2004/12/04 13:24:28 ponchio
|
|
Fixed a couple of memory leak...
|
|
|
|
Revision 1.1 2004/11/30 22:50:30 ponchio
|
|
Level 0.
|
|
|
|
|
|
****************************************************************************/
|
|
|
|
#ifndef NXS_VPARTITION_H
|
|
#define NXS_VPARTITION_H
|
|
|
|
#include <vector>
|
|
#include <string>
|
|
|
|
#include <vcg/space/point3.h>
|
|
|
|
|
|
//TODO provide a Sort function, to sort spatially the seeds.
|
|
|
|
class ANNkd_tree;
|
|
class ANNbd_tree;
|
|
class ANNbruteForce;
|
|
|
|
namespace nxs {
|
|
|
|
//WARNING: all distances returned are SQUARED!!!!
|
|
class VPartition: public std::vector<vcg::Point3f> {
|
|
public:
|
|
VPartition(): bd(NULL) {}
|
|
~VPartition();
|
|
private:
|
|
VPartition &operator=(const VPartition &part) {
|
|
for(unsigned int i = 0; i < part.size(); i++)
|
|
push_back(part[i]);
|
|
Init();
|
|
return *this;
|
|
}
|
|
public:
|
|
void Init();
|
|
int Locate(const vcg::Point3f &p);
|
|
|
|
//looks for the min distance point from seed.
|
|
float Radius(unsigned int seed);
|
|
void Closest(const vcg::Point3f &p, unsigned int nsize,
|
|
std::vector<int> &nears,
|
|
std::vector<float> &dist);
|
|
void Closest(const vcg::Point3f &p,
|
|
int &target, float &dist);
|
|
|
|
//return all targets widthin that distance (SQUARED!!!)
|
|
void Closest(const vcg::Point3f &p, std::vector<int> &targets,
|
|
std::vector<double> &dists,
|
|
float max_distance);
|
|
//most efficient!
|
|
void Closest(const vcg::Point3f &p, unsigned int nsize,
|
|
int *targets,
|
|
double *dists);
|
|
|
|
|
|
ANNkd_tree *bd;
|
|
std::vector<double> buffer;
|
|
std::vector<double *> points;
|
|
};
|
|
|
|
} //namespace nxs
|
|
#endif
|