|
| | Poly_CoherentTriangulation (const Handle< NCollection_BaseAllocator > &theAlloc=0L) |
| |
| | Poly_CoherentTriangulation (const Handle< Poly_Triangulation > &theTriangulation, const Handle< NCollection_BaseAllocator > &theAlloc=0L) |
| |
| virtual | ~Poly_CoherentTriangulation () |
| |
| Handle< Poly_Triangulation > | GetTriangulation () const |
| |
| Standard_Boolean | RemoveDegenerated (const Standard_Real theTol, NCollection_List< TwoIntegers > *pLstRemovedNode=0L) |
| |
| Standard_Boolean | GetFreeNodes (NCollection_List< Standard_Integer > &lstNodes) const |
| |
| Standard_Integer | MaxNode () const |
| |
| Standard_Integer | MaxTriangle () const |
| |
| void | SetDeflection (const Standard_Real theDefl) |
| |
| Standard_Real | Deflection () const |
| |
| Standard_Integer | SetNode (const gp_XYZ &thePnt, const Standard_Integer iN=-1) |
| |
| const Poly_CoherentNode & | Node (const Standard_Integer i) const |
| |
| Poly_CoherentNode & | ChangeNode (const Standard_Integer i) |
| |
| Standard_Integer | NNodes () const |
| |
| const Poly_CoherentTriangle & | Triangle (const Standard_Integer i) const |
| |
| Standard_Integer | NTriangles () const |
| |
| Standard_Integer | NLinks () const |
| |
| Standard_Boolean | RemoveTriangle (Poly_CoherentTriangle &theTr) |
| |
| void | RemoveLink (Poly_CoherentLink &theLink) |
| |
| Poly_CoherentTriangle * | AddTriangle (const Standard_Integer iNode0, const Standard_Integer iNode1, const Standard_Integer iNode2) |
| |
| Standard_Boolean | ReplaceNodes (Poly_CoherentTriangle &theTriangle, const Standard_Integer iNode0, const Standard_Integer iNode1, const Standard_Integer iNode2) |
| |
| Poly_CoherentLink * | AddLink (const Poly_CoherentTriangle &theTri, const Standard_Integer theConn) |
| |
| Standard_Boolean | FindTriangle (const Poly_CoherentLink &theLink, const Poly_CoherentTriangle *pTri[2]) const |
| |
| Standard_Integer | ComputeLinks () |
| |
| void | ClearLinks () |
| |
const Handle
< NCollection_BaseAllocator > & | Allocator () const |
| |
Handle
< Poly_CoherentTriangulation > | Clone (const Handle< NCollection_BaseAllocator > &theAlloc) const |
| |
| void | Dump (Standard_OStream &) const |
| |
 Public Member Functions inherited from Standard_Transient |
| | Standard_Transient () |
| | Empty constructor. More...
|
| |
| | Standard_Transient (const Standard_Transient &) |
| | Copy constructor – does nothing. More...
|
| |
| Standard_Transient & | operator= (const Standard_Transient &) |
| | Assignment operator, needed to avoid copying reference counter. More...
|
| |
| virtual | ~Standard_Transient () |
| | Destructor must be virtual. More...
|
| |
| virtual void | Delete () const |
| | Memory deallocator for transient classes. More...
|
| |
virtual const
Handle_Standard_Type & | DynamicType () const |
| | Returns a type information object about this object. More...
|
| |
| Standard_Boolean | IsInstance (const Handle_Standard_Type &theType) const |
| | Returns a true value if this is an instance of Type. More...
|
| |
| Standard_Boolean | IsInstance (const Standard_CString theTypeName) const |
| | Returns a true value if this is an instance of TypeName. More...
|
| |
| Standard_Boolean | IsKind (const Handle_Standard_Type &theType) const |
| | Returns true if this is an instance of Type or an instance of any class that inherits from Type. Note that multiple inheritance is not supported by OCCT RTTI mechanism. More...
|
| |
| Standard_Boolean | IsKind (const Standard_CString theTypeName) const |
| | Returns true if this is an instance of TypeName or an instance of any class that inherits from TypeName. Note that multiple inheritance is not supported by OCCT RTTI mechanism. More...
|
| |
| virtual Handle_Standard_Transient | This () const |
| | Returns a Handle which references this object. Must never be called to objects created in stack. More...
|
| |
| Standard_Integer | GetRefCount () const |
| | Get the reference counter of this object. More...
|
| |
Triangulation structure that allows to:
-
Store the connectivity of each triangle with up to 3 neighbouring ones and with the corresponding 3rd nodes on them,
-
Store the connectivity of each node with all triangles that share this node
-
Add nodes and triangles to the structure,
-
Find all triangles sharing a single or a couple of nodes
-
Remove triangles from structure
-
Optionally create Links between pairs of nodes according to the current triangulation.
-
Convert from/to Poly_Triangulation structure.
This class is useful for algorithms that need to analyse and/or edit a triangulated mesh – for example for mesh refining. The connectivity model follows the idea that all Triangles in a mesh should have coherent orientation like on a surface of a solid body. Connections between more than 2 triangles are not suppoorted.
<>
Architecture
The data types used in this structure are:
-
Poly_CoherentNode: Inherits go_XYZ therefore provides the full public API of gp_XYZ. Contains references to all incident triangles. You can add new nodes but you cannot remove existing ones. However each node that has no referenced triangle is considered as "free" (use the method IsFreeNode() to check this). Free nodes are not available to further processing, particularly they are not exported in Poly_Triangulation.
-
Poly_CoherentTriangle: Main data type. Refers three Nodes, three connected Triangles, three opposite (connected) Nodes and three Links. If there is boundary then 1, 2 or 3 references to Triangles/connected Nodes/Links are assigned to NULL (for pointers) or -1 (for integer node index).
You can find a triangle by one node using its triangle iterator or by two nodes - creating a temporary Poly_CoherentLink and calling the method FindTriangle().
Triangles can be removed but they are never deleted from the containing array. Removed triangles have all nodes equal to -1. You can use the method IsEmpty() to check that.
-
Poly_CoherentLink: Auxiliary data type. Normally the array of Links is empty, because for many algorithms it is sufficient to define only Triangles. You can explicitly create the Links at least once, calling the method ComputeLinks(). Each Link is oriented couple of Poly_CoherentNode (directed to the ascending Node index). It refers two connected triangulated Nodes - on the left and on the right, therefore a Poly_CoherentLink instance refers the full set of nodes that constitute a couple of connected Triangles. A boundary Link has either the first (left) or the second (right) connected node index equal to -1.
When the array of Links is created, all subsequent calls to AddTriangle and RemoveTriangle try to preserve the connectivity Triangle-Link in addition to the connectivity Triangle-Triangle. Particularly, new Links are created by method AddTriangle() and existing ones are removed by method RemoveTriangle(), in each case whenever necessary.
Similarly to Poly_CoherentTriangle, a Link can be removed but not destroyed separately from others. Removed Link can be recogniosed using the method IsEmpty(). To destroy all Links, call the method ClearLinks(), this method also nullifies Link references in all Triangles. All objects (except for free Nodes and empty Triangles and Links) can be visited by the corresponding Iterator. Direct access is provided only for Nodes (needed to resolve Node indexed commonly used as reference). Triangles and Links can be retrieved by their index only internally, the public API provides only references or pointers to C++ objects. If you need a direct access to Triangles and Links, you can subclass Poly_CoherentTriangulation and use the protected API for your needs.
Memory management: All data objects are stored in NCollection_Vector containers that prove to be efficient for the performance. In addition references to triangles are stored in ring lists, with an instance of such list per Poly_CoherentNode. These lists are allocated in a memory allocator that is provided in the constructor of Poly_CoherentTriangulation. By default the standard OCCT allocator (aka NCollection_BaseAllocator) is used. But if you need to increase the performance you can use NCollection_IncAllocator instead.
