manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

*** empty log message ***

This commit is contained in:
Federico Ponchio 2007-06-08 14:57:29 +00:00
parent 279306b9f7
commit d8032a9bc0
1 changed files with 19 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
vcg/space/sphere3.h
View File

@ -24,6 +24,9 @@
History History
$Log: not supported by cvs2svn $ $Log: not supported by cvs2svn $
Revision 1.9 2006/07/06 12:40:34 ganovelli
typdef ..ScalarType added
Revision 1.8 2005/02/22 14:18:15 ponchio Revision 1.8 2005/02/22 14:18:15 ponchio
assert addded. assert addded.
@ -90,6 +93,8 @@ protected:
void Add(const Sphere3 &sphere); void Add(const Sphere3 &sphere);
void Intersect(const Sphere3 &sphere); void Intersect(const Sphere3 &sphere);
int CreateFromBox(int n, const Point3<T> *points);
//makes 36 iterations over the data... but get good results. //makes 36 iterations over the data... but get good results.
int CreateTight(int n, const Point3<T> *points, int CreateTight(int n, const Point3<T> *points,
T threshold = 1.01, T speed = 0.6); T threshold = 1.01, T speed = 0.6);
@ -161,6 +166,20 @@ template <class T> void Sphere3<T>::Intersect(const Sphere3<T> &s) {
_radius = r; _radius = r;
} }
template <class T> int Sphere3<T>::CreateFromBox(int n, const Point3<T> *points) {
Point3f max(-1e100, -1e100, -1e100);
Point3f min(1e100, 1e100, 1e100);
for(int i = 0; i < n; i++) {
for(int k = 0; k < 3; k++) {
if(max[k] < points[i][k]) max[k] = points[i][k];
if(min[k] > points[i][k]) min[k] = points[i][k];
}
}
Center() = (min + max)/2;
Radius() = (min - max).Norm()/2;
return 0;
}
template <class T> int Sphere3<T>::CreateTight(int n, const Point3<T> *points, template <class T> int Sphere3<T>::CreateTight(int n, const Point3<T> *points,
T threshold, T speed) { T threshold, T speed) {
//This is quantized gradient descent... really ugly. But simple :P //This is quantized gradient descent... really ugly. But simple :P