mirror of
https://github.com/NGSolve/netgen.git
synced 2024-09-23 02:02:49 +05:00
118 lines
1.9 KiB
C++
118 lines
1.9 KiB
C++
#ifndef FILE_GEOMSEARCH
|
|
#define FILE_GEOMSEARCH
|
|
|
|
/**************************************************************************/
|
|
/* File: geomsearch.hh */
|
|
/* Author: Johannes Gerstmayr */
|
|
/* Date: 19. Nov. 97 */
|
|
/**************************************************************************/
|
|
|
|
class FrontPoint3;
|
|
class FrontFace;
|
|
class MiniElement2d;
|
|
|
|
/// class for quick access of 3D-elements; class cannot delete elements, but only append
|
|
class GeomSearch3d
|
|
{
|
|
|
|
public:
|
|
///
|
|
GeomSearch3d();
|
|
///
|
|
virtual ~GeomSearch3d();
|
|
|
|
///
|
|
void Init (Array <FrontPoint3,PointIndex::BASE> *pointsi, Array <FrontFace> *facesi);
|
|
|
|
///get elements max extension
|
|
void ElemMaxExt(Point3d& minp, Point3d& maxp, const MiniElement2d& elem);
|
|
|
|
///get minimum coordinates of two points ->p2
|
|
void MinCoords(const Point3d& p1, Point3d& p2);
|
|
|
|
///get minimum coordinates of two points ->p2
|
|
void MaxCoords(const Point3d& p1, Point3d& p2);
|
|
|
|
///create a hashtable from an existing array of triangles
|
|
///sizei = number of pieces in one direction
|
|
void Create();
|
|
|
|
///add new element to Hashtable
|
|
void AddElem(const MiniElement2d& elem, INDEX elemnum);
|
|
|
|
///GetLocal faces in sphere with radius xh and middlepoint p
|
|
void GetLocals(Array<MiniElement2d> & locfaces, Array<INDEX> & findex,
|
|
INDEX fstind, const Point3d& p0, double xh);
|
|
|
|
private:
|
|
|
|
Array <FrontFace> *faces; // Pointers to Arrays in Adfront
|
|
Array <FrontPoint3,PointIndex::BASE> *points;
|
|
|
|
Array <Array <int>*> hashtable;
|
|
|
|
Point3d minext; //extension of Hashdomain
|
|
Point3d maxext;
|
|
Point3d maxextreal;
|
|
Vec3d elemsize; //size of one Hash-Element
|
|
|
|
threeint size; // size of Hashtable in each direction
|
|
int reset;
|
|
int hashcount;
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|