gmsh-TingyuanDoc
0.1
An Open-Source Timing-driven Analytical Mixed-size FPGA Placer
|
Go to the documentation of this file.
58 std::vector<int> &surfaces);
60 typedef std::map<MFace, GFace *, MFaceLessThan>
fs_cont;
61 typedef std::multimap<MVertex *, std::pair<MLine *, GEdge *> >
es_cont;
68 bool onlyTriangles =
false);
74 std::map<MFace, MVertex *, MFaceLessThan>
_quad;
75 std::map<MFace, GFace *, MFaceLessThan>
_tri;
80 std::map<MFace, GFace *, MFaceLessThan> &
getTri() {
return _tri; }
81 std::map<MFace, MVertex *, MFaceLessThan> &
getQuad() {
return _quad; }
bool buildFaceSearchStructure(GModel *model, fs_cont &search, bool onlyTriangles=false)
std::multimap< MVertex *, std::pair< MLine *, GEdge * > > es_cont
bool buildEdgeSearchStructure(GModel *model, es_cont &search)
double distance(MVertex *v1, MVertex *v2)
void operator()(GRegion *)
int buildPyramids(GModel *gm)
void f(int n, double u, double *val)
GEdge * findInEdgeSearchStructure(MVertex *p1, MVertex *p2, const es_cont &search)
int SubdivideExtrudedMesh(GModel *m)
void operator()(GRegion *, bool always=false)
void operator()(GRegion *, bool always=false)
int MeshTransfiniteVolume(GRegion *gr)
std::vector< GRegion * > & delaunay
void add(const MFace &f, MVertex *v, GFace *gf)
std::map< MFace, MVertex *, MFaceLessThan > _quad
void operator()(GRegion *)
std::map< MFace, MVertex *, MFaceLessThan > & getQuad()
void operator()(GRegion *)
void operator()(GRegion *)
std::map< MFace, GFace *, MFaceLessThan > & getTri()
GFace * findInFaceSearchStructure(MVertex *p1, MVertex *p2, MVertex *p3, const fs_cont &search)
bool CreateAnEmptyVolumeMesh(GRegion *gr)
std::map< MFace, GFace *, MFaceLessThan > fs_cont
void MeshDelaunayVolume(std::vector< GRegion * > &delaunay)
std::map< MFace, GFace *, MFaceLessThan > _tri
void carveHole(GRegion *gr, int num, double distance, std::vector< int > &surfaces)
meshGRegion(std::vector< GRegion * > &d)