blob: a06fa355dfefaa1d66cb4f68cfb0318fa67c9e3e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
// File: Poly_CoherentLink.hxx
// Created: 25.12.07 12:47
// Author: Alexander GRIGORIEV
// Copyright: Open Cascade 2007
#ifndef Poly_CoherentLink_HeaderFile
#define Poly_CoherentLink_HeaderFile
#include <Standard_TypeDef.hxx>
class Poly_CoherentTriangle;
class Poly_CoherentTriangulation;
/**
* Link between two mesh nodes that is created by existing triangle(s).
* Keeps reference to the opposite node of each incident triangle.
* The referred node with index "0" is always on the left side of the link,
* the one with the index "1" is always on the right side.
* It is possible to find both incident triangles using the method
* Poly_CoherentTriangulation::FindTriangle().
* <p>
* Any Link can store an arbitrary pointer that is called Attribute.
*/
class Poly_CoherentLink
{
public:
// ---------- PUBLIC METHODS ----------
/**
* Empty constructor.
*/
Standard_EXPORT Poly_CoherentLink ();
/**
* Constructor. Creates a Link that has no reference to 'opposite nodes'.
* This constructor is useful to create temporary object that is not
* inserted into any existing triangulation.
*/
inline Poly_CoherentLink (const Standard_Integer iNode0,
const Standard_Integer iNode1)
: myAttribute (0L)
{
myNode[0] = iNode0; myNode[1] = iNode1;
myOppositeNode[0] = -1; myOppositeNode[1] = -1;
}
/**
* Constructor, takes a triangle and a side. A link is created always such
* that myNode[0] < myNode[1]. Unlike the previous constructor, this one
* assigns the 'opposite node' fields. This constructor is used when a
* link is inserted into a Poly_CoherentTriangulation structure.
* @param theTri
* Triangle containing the link that is created
* @param iSide
* Can be 0, 1 or 2. Index of the node
*/
Standard_EXPORT Poly_CoherentLink (const Poly_CoherentTriangle& theTri,
Standard_Integer iSide);
/**
* Return the node index in the current triangulation.
* @param ind
* 0 or 1 making distinction of the two nodes that constitute the Link.
* Node(0) always returns a smaller number than Node(1).
*/
inline Standard_Integer Node (const Standard_Integer ind) const
{ return myNode[ind & 0x1]; }
/**
* Return the opposite node (belonging to the left or right incident triangle)
* index in the current triangulation.
* @param ind
* 0 or 1 making distinction of the two involved triangles: 0 on the left,
* 1 on the right side of the Link.
*/
inline Standard_Integer OppositeNode (const Standard_Integer ind) const
{ return myOppositeNode[ind & 0x1]; }
/**
* Query the attribute of the Link.
*/
inline Standard_Address GetAttribute () const
{ return myAttribute; }
/**
* Set the attribute of the Link.
*/
inline void SetAttribute (const Standard_Address theAtt)
{ myAttribute = theAtt; }
/**
* Query the status of the link - if it is an invalid one.
* An invalid link has Node members equal to -1.
*/
inline Standard_Boolean IsEmpty () const
{ return myNode[0] < 0 || myNode[1] < 0; }
/**
* Invalidate this Link.
*/
inline void Nullify ()
{
myNode[0] = -1; myNode[1] = -1;
myOppositeNode[0] = -1; myOppositeNode[1] = -1;
}
protected:
// ---------- PROTECTED METHODS ----------
private:
// ---------- PRIVATE FIELDS ----------
Standard_Integer myNode[2];
Standard_Integer myOppositeNode[2];
Standard_Address myAttribute;
friend class Poly_CoherentTriangulation;
};
#endif
|
