#include <Poly_Connect.hxx>
Public Member Functions | |
void * | operator new (size_t, void *anAddress) |
void * | operator new (size_t size) |
void | operator delete (void *anAddress) |
Standard_EXPORT | Poly_Connect (const Handle(Poly_Triangulation)&T) |
Constructs an algorithm to explore the adjacency data of nodes or triangles for the triangulation T. . | |
Handle_Poly_Triangulation | Triangulation () const |
Returns the triangulation analyzed by this tool. . | |
Standard_Integer | Triangle (const Standard_Integer N) const |
Returns the index of a triangle containing the node at index N in the nodes table specific to the triangulation analyzed by this tool . | |
Standard_EXPORT void | Triangles (const Standard_Integer T, Standard_Integer &t1, Standard_Integer &t2, Standard_Integer &t3) const |
Returns in t1, t2 and t3, the indices of the 3 triangles adjacent to the triangle at index T in the triangles table specific to the triangulation analyzed by this tool. Warning Null indices are returned when there are fewer than 3 adjacent triangles. . | |
Standard_EXPORT void | Nodes (const Standard_Integer T, Standard_Integer &n1, Standard_Integer &n2, Standard_Integer &n3) const |
Returns, in n1, n2 and n3, the indices of the 3 nodes adjacent to the triangle referenced at index T in the triangles table specific to the triangulation analyzed by this tool. Warning Null indices are returned when there are fewer than 3 adjacent nodes. . | |
Standard_EXPORT void | Initialize (const Standard_Integer N) |
Initializes an iterator to search for all the triangles containing the node referenced at index N in the nodes table, for the triangulation analyzed by this tool. The iterator is managed by the following functions: - More, which checks if there are still elements in the iterator - Next, which positions the iterator on the next element - Value, which returns the current element. The use of such an iterator provides direct access to the triangles around a particular node, i.e. it avoids iterating on all the component triangles of a triangulation. Example Poly_Connect C(Tr); for (C.Initialize(n1);C.More();C.Next()) { t = C.Value(); } . | |
Standard_Boolean | More () const |
Returns true if there is another element in the iterator defined with the function Initialize (i.e. if there is another triangle containing the given node). . | |
Standard_EXPORT void | Next () |
Advances the iterator defined with the function Initialize to access the next triangle. Note: There is no action if the iterator is empty (i.e. if the function More returns false).- . | |
Standard_EXPORT Standard_Integer | Value () const |
Returns the index of the current triangle to which the iterator, defined with the function Initialize, points. This is an index in the triangles table specific to the triangulation analyzed by this tool . | |
Private Attributes | |
Handle_Poly_Triangulation | myTriangulation |
TColStd_Array1OfInteger | myTriangles |
TColStd_Array1OfInteger | myAdjacents |
Standard_Integer | mytr |
Standard_Integer | myfirst |
Standard_Integer | mynode |
Standard_Integer | myothernode |
Standard_Boolean | mysense |
Standard_Boolean | mymore |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|