/usr/include/freefem++/FQuadTree.hpp is in libfreefem++-dev 3.47+dfsg1-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // ********** DO NOT REMOVE THIS BANNER **********
/*
This file is part of Freefem++
Freefem++ is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
Freefem++ 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with Freefem++; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
// AUTHOR: F. Hecht,
// ORG : UMPC
// E-MAIL : Frederic.Hecht@Inria.fr
//
// ORIG-DATE: Dec 97
namespace Fem2D {
const int MaxDeep = 30;
typedef long IntQuad;
const IntQuad MaxISize = ( 1L << MaxDeep);
class Mesh;
//typename Vertex;
class FQuadTree {
public:
class I2 { public:
static bool INTER_SEG1d(long a,long b,long x,long y) { return (((y) > (a)) && ((x) <(b)));}
long x,y;
I2() {}
I2(long i,long j): x(i),y(j) {}
I2(const I2 &pp,long k,long l): x(pp.x+(( k&1) ? l : 0)),y(pp.y+(( k&2) ? l : 0)) {}
void Add(long k,long l) { x+= (( k&1) ? l : 0) ; y+= (( k&2) ? l : 0);}
I2(const I2 &A,const I2 &B) : x(B.x-A.x),y(B.y-A.y) {}
long Case(long l) const { return ( ( y & l) ? (( x & l) ? 3 : 2 ) :( ( x & l)? 1 : 0 ));}
long norm() const { return Max(abs(x),abs(y));}
bool less(I2 h) const { return abs(x) <h.x && abs(y) <h.y;}
bool interseg(I2 pp,long hb,long h) const {
return INTER_SEG1d(x,x+hb,pp.x-h,pp.x+h) && INTER_SEG1d(y,y+hb,pp.y-h,pp.y+h);}
bool interseg(const I2 &pp,long hb,const I2 &h) const {
return INTER_SEG1d(x,x+hb,pp.x-h.x,pp.x+h.x) && INTER_SEG1d(y,y+hb,pp.y-h.y,pp.y+h.y);}
};
class QuadTreeBox {
public:
long n; // if n < 4 => Vertex else => QuadTreeBox;
union {
QuadTreeBox *b[4];
Vertex * v[4];
};
}; // end class QuadTreeBox /////////////////
class StorageQuadTreeBox {
public:
QuadTreeBox *b,*bc,*be;
long len;
StorageQuadTreeBox *n; // next StorageQuadTreeBox
StorageQuadTreeBox(long ,StorageQuadTreeBox * =0);
~StorageQuadTreeBox();
long SizeOf() const {
return len*sizeof(QuadTreeBox)+sizeof(StorageQuadTreeBox)+ (n?n->SizeOf():0);
}
}; // end class StorageQuadTreeBox
StorageQuadTreeBox * sb;
long lenStorageQuadTreeBox;
public:
QuadTreeBox * root;
const Mesh *th;
long NbQuadTreeBoxSearch,NbVerticesSearch;
long NbQuadTreeBox,NbVertices;
R2 cMin,cMax; // box of QuadTree
R coef; //
long XtoI(R x) { return (long) ((Max(Min(x,cMax.x),cMin.x)-cMin.x)*coef);}
long YtoJ(R y) { return (long) ((Max(Min(y,cMax.y),cMin.y)-cMin.y)*coef);}
R ItoX(long i){ return double(i)*coef+cMin.x ;}
R ItoY(long j){ return double(j)*coef+cMin.y ;}
I2 R2ToI2(const R2 &P) { return I2(XtoI(P.x),YtoJ(P.y));}
I2 R2ToI2(const R2 *P) { return I2(XtoI(P->x),YtoJ(P->y));}
Vertex * NearestVertex(const R2 & P) { return NearestVertex(XtoI(P.x),YtoJ(P.y));}
Vertex * NearestVertexWithNormal(const R2 & P);
// { return NearestVertexWithNormal(XtoI(P.x),YtoJ(P.y));}
Vertex * NearestVertex(long i,long j);
// Vertex * NearestVertexWithNormal(long i,long j); // new version
Vertex * ToClose(const R2 & ,R ,long,long);
Vertex * ToClose(const R2 & P,R delta){
long hx = (long) (coef*delta);
return ToClose(P,delta,hx,hx);}
long SizeOf() const {return sizeof(FQuadTree)+sb->SizeOf();}
#ifdef DRAWING
void IMoveTo(long i,long j)
{ rmoveto(float(i)/coef+cMin.x ,float(j)/coef+cMin.y );}
void ILineTo(long i,long j)
{rlineto(float(i)/coef+cMin.x ,float(j)/coef+cMin.y );}
void Draw();
void PlotQuad(I2 pp,long hb);
void PlotX(I2 pp,long hb);
#endif
void Add( Vertex & w);
QuadTreeBox* NewQuadTreeBox()
{
///cout << "NewQuadTreeBox " << sb << " " << sb->bc << " "
//<< sb->be << " " <<lenStorageQuadTreeBox <<endl;
if(! (sb->bc<sb->be))
sb=new StorageQuadTreeBox(lenStorageQuadTreeBox,sb);
throwassert(sb && (sb->bc->n == 0));
NbQuadTreeBox++;
return sb->bc++;
}
~FQuadTree();
FQuadTree(const Mesh* t,long tnv,R2 Pmin,R2 Pmax,long nbv=-1);
FQuadTree(const Mesh * t,R2 Pmin,R2 Pmax,long nbv=-1);
FQuadTree(Vertex * v,R2 Pmin,R2 Pmax,long nbv);
FQuadTree();
friend ostream& operator <<(ostream& f, const FQuadTree & qt);
};
//#undef IJ
} // name space
|