Open CASCADE Technology
6.5.4
|
Compute the Delaunay's triangulation with the
algorithm of Watson.
#include <BRepMesh_Delaun.hxx>
Public Member Functions | |
DEFINE_STANDARD_ALLOC | BRepMesh_Delaun (BRepMesh_Array1OfVertexOfDelaun &Vertices, const Standard_Boolean ZPositive=Standard_True) |
Creates the triangulation with an empty Mesh data structure. | |
BRepMesh_Delaun (const Handle< BRepMesh_DataStructureOfDelaun > &OldMesh, BRepMesh_Array1OfVertexOfDelaun &Vertices, const Standard_Boolean ZPositive=Standard_True) | |
Creates the triangulation with and existant Mesh data structure. | |
BRepMesh_Delaun (const Handle< BRepMesh_DataStructureOfDelaun > &OldMesh, TColStd_Array1OfInteger &VertexIndices, const Standard_Boolean ZPositive=Standard_True) | |
Creates the triangulation with and existant Mesh data structure. | |
void | RemoveVertex (const BRepMesh_Vertex &theVertex) |
Removes a vertex in the triangulation. | |
void | AddVertices (BRepMesh_Array1OfVertexOfDelaun &Vertices) |
Adds some vertices in the triangulation. | |
Standard_Boolean | UseEdge (const Standard_Integer theEdge) |
Modify mesh to use the edge. Return True if done. | |
const Handle_BRepMesh_DataStructureOfDelaun & | Result () const |
Gives the Mesh data structure. | |
const BRepMesh_MapOfInteger & | Frontier () |
Gives the list of frontier edges | |
const BRepMesh_MapOfInteger & | InternalEdges () |
Gives the list of internal edges | |
const BRepMesh_MapOfInteger & | FreeEdges () |
Gives the list of free edges used only one time | |
const BRepMesh_Vertex & | GetVertex (const Standard_Integer vIndex) const |
const BRepMesh_Edge & | GetEdge (const Standard_Integer eIndex) const |
const BRepMesh_Triangle & | GetTriangle (const Standard_Integer tIndex) const |
void | Init (BRepMesh_Array1OfVertexOfDelaun &Vertices) |
Initializes the triangulation with an Array of Vertex. | |
void | Compute (TColStd_Array1OfInteger &VertexIndices) |
Computes the triangulation and add the vertices edges and triangles to the Mesh data structure. | |
void | SuperMesh (const Bnd_Box2d &theBox) |
Build the super mesh . | |
Standard_Boolean | Contains (const Standard_Integer TrianIndex, const BRepMesh_Vertex &theVertex, Standard_Integer &edgeOn) const |
Test if triangle of index <TrianIndex> contains geometricaly <theVertex>. If <EdgeOn> is != 0 then theVertex is on Edge of index <edgeOn>. |
DEFINE_STANDARD_ALLOC BRepMesh_Delaun::BRepMesh_Delaun | ( | BRepMesh_Array1OfVertexOfDelaun & | Vertices, |
const Standard_Boolean | ZPositive = Standard_True |
||
) |
BRepMesh_Delaun::BRepMesh_Delaun | ( | const Handle< BRepMesh_DataStructureOfDelaun > & | OldMesh, |
BRepMesh_Array1OfVertexOfDelaun & | Vertices, | ||
const Standard_Boolean | ZPositive = Standard_True |
||
) |
BRepMesh_Delaun::BRepMesh_Delaun | ( | const Handle< BRepMesh_DataStructureOfDelaun > & | OldMesh, |
TColStd_Array1OfInteger & | VertexIndices, | ||
const Standard_Boolean | ZPositive = Standard_True |
||
) |
void BRepMesh_Delaun::AddVertices | ( | BRepMesh_Array1OfVertexOfDelaun & | Vertices | ) |
void BRepMesh_Delaun::Compute | ( | TColStd_Array1OfInteger & | VertexIndices | ) |
Standard_Boolean BRepMesh_Delaun::Contains | ( | const Standard_Integer | TrianIndex, |
const BRepMesh_Vertex & | theVertex, | ||
Standard_Integer & | edgeOn | ||
) | const |
const BRepMesh_Edge& BRepMesh_Delaun::GetEdge | ( | const Standard_Integer | eIndex | ) | const |
const BRepMesh_Triangle& BRepMesh_Delaun::GetTriangle | ( | const Standard_Integer | tIndex | ) | const |
const BRepMesh_Vertex& BRepMesh_Delaun::GetVertex | ( | const Standard_Integer | vIndex | ) | const |
void BRepMesh_Delaun::Init | ( | BRepMesh_Array1OfVertexOfDelaun & | Vertices | ) |
void BRepMesh_Delaun::RemoveVertex | ( | const BRepMesh_Vertex & | theVertex | ) |
const Handle_BRepMesh_DataStructureOfDelaun& BRepMesh_Delaun::Result | ( | ) | const |
void BRepMesh_Delaun::SuperMesh | ( | const Bnd_Box2d & | theBox | ) |