Inheritance diagram for TopSbdSurf3d< C, CELL, MSLV >:
Definition at line 34 of file TopSbdSurf.h.
Public Types | |
typedef TopSbdSurf3d< C, CELL, MSLV > | self_t |
typedef TopSbdCurve3d< C, CELL, MSLV > | base_t |
typedef CELL::coeff_t | coeff_t |
typedef CELL::MPOL_T | MPOL_T |
typedef topology::box3d< coeff_t > | box_t |
typedef CELL | cell_t |
typedef OCTREE::Node< cell_t * > | node_t |
typedef OCTREE::Octree< cell_t * > | octree_t |
typedef topology::point< C > | point_t |
typedef topology::point_graph< C > | pointgraph_t |
typedef intersection3d< coeff_t > | intersection_t |
typedef Seq< intersection3d< coeff_t > * > | intersectionlist_t |
typedef shared_object< intersection_t * > | intersection_ptr |
typedef Seq< intersection_ptr > | intersection_ptr_list |
typedef topology::point_graph< coeff_t, intersection_ptr_list > | pointgraph_int_t |
typedef MPolDse< coeff_t, mpoldse::bernstein< coeff_t > > | mpolb_t |
Public Member Functions | |
TopSbdSurf3d () | |
TopSbdSurf3d (unsigned mn, unsigned mx=6) | |
TopSbdSurf3d (coeff_t e) | |
TopSbdSurf3d (coeff_t e, int d) | |
bool | compute_point_inside (point_t &p, cell_t *c) |
void | computeintersections (intersectionlist_t &inters, cell_t &c) |
void | computeinter_face (intersectionlist_t &inters, cell_t &c, int nAxis, int nFace) |
void | computeinter_face (intersectionlist_t &inters, cell_t &c, int n1Axis, int n1Face, int n2Axis, int n2Face) |
void | computeinter_edge (intersectionlist_t &inters, cell_t &c, OCTREE::EDGE_TYPE edge) |
void | computeinter_edges (intersectionlist_t &inters, cell_t &c) |
bool | regularity (CELL &c) |
template<class POINTGRAPH> | |
void | build_mesh (POINTGRAPH &g, node_t *n) |
void | compute_points (node_t *n) |
template<class POINTGRAPH> | |
void | run (POINTGRAPH &g, CELL *rc) |
Public Attributes | |
unsigned | m_min_dp |
unsigned | m_max_dp |
MatrDse< Seq< OCTREE::NODE_TYPE > > | insert_matr |
Static Public Attributes | |
static OCTREE::EDGE_TYPE | EdgesOfFace [6][4] |
Protected Member Functions | |
void | subdivide (node_t *n, std::vector< node_t * > &aNodeList) |
void | subdivide (CELL *cell, std::vector< CELL * > &subCells) |
void | deleteNode (node_t *n, std::vector< intersection_t * > &inters) |
Protected Attributes | |
C | m_dEpsilon |
int | m_nMinSbd |
octree_t | m_cOcTree |
int | m_nCount |