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
|
// File gp_Pln.cxx , JCV 03/06/90
// JCV 30/08/90 Modif passage version C++ 2.0 sur Sun
// JCV 1/10/90 Changement de nom du package vgeom -> gp
// JCV 12/12/90 Modif suite a la premiere revue de projet
// LPA, JCV 07/92 passage sur C1.
// JCV 07/92 Introduction de la method Dump
// LBO 08/93 Passage aux Ax3
#include <gp_Pln.ixx>
#include <gp.hxx>
gp_Pln::gp_Pln (const gp_Pnt& P,
const gp_Dir& V)
{
Standard_Real A = V.X();
Standard_Real B = V.Y();
Standard_Real C = V.Z();
Standard_Real Aabs = A;
if (Aabs < 0) Aabs = - Aabs;
Standard_Real Babs = B;
if (Babs < 0) Babs = - Babs;
Standard_Real Cabs = C;
if (Cabs < 0) Cabs = - Cabs;
// pour determiner l'axe X :
// on dit que le produit scalaire Vx.V = 0.
// et on recherche le max(A,B,C) pour faire la division.
// l'une des coordonnees du vecteur est nulle.
if( Babs <= Aabs && Babs <= Cabs) {
if (Aabs > Cabs) pos = gp_Ax3 (P, V, gp_Dir (-C,0., A));
else pos = gp_Ax3 (P, V, gp_Dir ( C,0.,-A));
}
else if( Aabs <= Babs && Aabs <= Cabs) {
if (Babs > Cabs) pos = gp_Ax3 (P, V, gp_Dir (0.,-C, B));
else pos = gp_Ax3 (P, V, gp_Dir (0., C,-B));
}
else {
if (Aabs > Babs) pos = gp_Ax3 (P, V, gp_Dir (-B, A,0.));
else pos = gp_Ax3 (P, V, gp_Dir ( B,-A,0.));
}
}
gp_Pln::gp_Pln (const Standard_Real A,
const Standard_Real B,
const Standard_Real C,
const Standard_Real D)
{
Standard_Real Aabs = A;
if (Aabs < 0) Aabs = - Aabs;
Standard_Real Babs = B;
if (Babs < 0) Babs = - Babs;
Standard_Real Cabs = C;
if (Cabs < 0) Cabs = - Cabs;
if (Babs <= Aabs && Babs <= Cabs) {
if (Aabs > Cabs) pos = gp_Ax3(gp_Pnt(-D/A, 0., 0.),
gp_Dir(A,B,C),
gp_Dir(-C,0., A));
else pos = gp_Ax3(gp_Pnt( 0., 0.,-D/C),
gp_Dir(A,B,C),
gp_Dir( C,0.,-A));
}
else if (Aabs <= Babs && Aabs <= Cabs) {
if (Babs > Cabs) pos = gp_Ax3(gp_Pnt( 0.,-D/B, 0.),
gp_Dir(A,B,C),
gp_Dir(0.,-C, B));
else pos = gp_Ax3(gp_Pnt( 0., 0.,-D/C),
gp_Dir(A,B,C),
gp_Dir(0., C,-B));
}
else {
if (Aabs > Babs) pos = gp_Ax3(gp_Pnt(-D/A, 0., 0.),
gp_Dir(A,B,C),
gp_Dir(-B, A, 0.));
else pos = gp_Ax3(gp_Pnt( 0.,-D/B, 0.),
gp_Dir(A,B,C),
gp_Dir( B,-A, 0.));
}
}
void gp_Pln::Mirror (const gp_Pnt& P)
{ pos.Mirror(P); }
gp_Pln gp_Pln::Mirrored (const gp_Pnt& P) const
{
gp_Pln Pl = *this;
Pl.pos.Mirror(P);
return Pl;
}
void gp_Pln::Mirror (const gp_Ax1& A1)
{ pos.Mirror(A1); }
gp_Pln gp_Pln::Mirrored (const gp_Ax1& A1) const
{
gp_Pln Pl = *this;
Pl.pos.Mirror(A1);
return Pl;
}
void gp_Pln::Mirror (const gp_Ax2& A2)
{ pos.Mirror(A2); }
gp_Pln gp_Pln::Mirrored (const gp_Ax2& A2) const
{
gp_Pln Pl = *this;
Pl.pos.Mirror(A2);
return Pl;
}
|
