5 let private EPS = 1.0e-5
7 let inline private ellipse2tr (x
: float) (y
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff
: float) : float =
8 aa
* x
* x
+ bb
* x
* y
+ cc
* y
* y
+ dd
* x
+ ee
* y
+ ff
10 let private nointpts
(a1
: float) (b1
: float) (a2
: float) (b2
: float) (h1
: float) (k1
: float) (h2
: float) (k2
: float) (phi_1
: float) (phi_2
: float) (h2_tr
: float) (k2_tr
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff
: float) =
13 let area_1 = Math.PI * a1b1
14 let area_2 = Math.PI * a2b2
15 let relsize = a1b1 - a2b2
19 if (h2_tr
* h2_tr
) / (a1
* a1
) + (k2_tr
* k2_tr
) / (b1
* b1
) < 1.0
30 if abs
(h1
- h2
) < EPS && abs
(k1
- k2
) < EPS && abs
(area_1 - area_2) < EPS
34 type private PointType = TANGENT_POINT | INTERSECTION_POINT
36 let private istanpt
(x
: float) (y
: float) (a1
: float) (b1
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff
: float) : PointType =
40 if x < 0.0 then -a1
else a1
45 then 2.0 * Math.PI - acos
(x / a1)
50 let x1 = a1 * cos
(theta + eps_radian)
51 let y1 = b1
* sin
(theta + eps_radian)
52 let x2 = a1 * cos
(theta - eps_radian)
53 let y2 = b1
* sin
(theta - eps_radian)
55 let test1 = ellipse2tr x1 y1 aa bb cc dd ee
ff
56 let test2 = ellipse2tr x2 y2 aa bb cc dd ee
ff
59 printf
"\t\t--- debug istanpt with (x,y)=(%f, %f), A1=%f, B1=%f\n" x y
a1 b1
60 printf
"theta=%f\n" theta
61 printf
"eps_Radian=%f\n" eps_radian
62 printf
"(x1, y1)=(%f, %f)\n" x1 y1
63 printf
"(x2, y2)=(%f, %f)\n" x2 y2
64 printf
"test1=%f\n" test1
65 printf
"test2=%f\n" test2
68 if test1 * test2 > 0.0
70 else INTERSECTION_POINT
73 let private twointpts
(x: float[]) (y
: float[]) (a1: float) (b1
: float) (phi_1
: float) (a2
: float) (b2
: float) (h2_tr
: float) (k2_tr
: float) (phi_2
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff: float) =
75 then x.[0] <- if x.[0] < 0.0 then -a1 else a1
79 then 2.0 * Math.PI - acos (x.[0] / a1)
80 else acos (x.[0] / a1)
83 then x.[1] <- if x.[1] < 0.0 then -a1 else a1
87 then 2.0 * Math.PI - acos (x.[1] / a1)
88 else acos (x.[1] / a1)
96 let xmid = a1 * cos
((theta1 + theta2) / 2.0)
97 let ymid = b1
* sin
((theta1 + theta2) / 2.0)
99 if ellipse2tr xmid ymid aa bb cc dd ee
ff > 0.0
107 theta1 <- theta1 - 2.0 * Math.PI
109 let trsign = if (theta2 - theta1) > Math.PI then 1.0 else -1.0
111 let mutable area1 = 0.5 * (a1 * b1
* (theta2 - theta1) + trsign * abs
(x.[0] * y
.[1] - x.[1] * y
.[0]))
116 printf
"TWO area1=%f\n" area1
118 area1 <- area1 + a1 * b1
120 let cosphi = cos
(phi_1
- phi_2
)
121 let sinphi = sin
(phi_1
- phi_2
)
123 let mutable x1_tr = (x.[0] - h2_tr
) * cosphi + (y
.[0] - k2_tr
) * -sinphi
124 let mutable y1_tr = (x.[0] - h2_tr
) * sinphi + (y
.[0] - k2_tr
) * cosphi
125 let mutable x2_tr = (x.[1] - h2_tr
) * cosphi + (y
.[1] - k2_tr
) * -sinphi
126 let mutable y2_tr = (x.[1] - h2_tr
) * sinphi + (y
.[1] - k2_tr
) * cosphi
130 x1_tr <- if x1_tr < 0.0 then -a2
else a2
134 theta1 <- 2.0 * Math.PI - acos (x1_tr / a2)
136 theta1 <- acos (x1_tr / a2)
140 x2_tr <- if x2_tr < 0.0 then -a2 else a2
144 theta2 <- 2.0 * Math.PI - acos (x2_tr / a2)
146 theta2 <- acos (x2_tr / a2)
154 let xmid = a2 * cos
((theta1 + theta2) / 2.0)
155 let ymid = b2
* sin
((theta1 + theta2) / 2.0)
157 let cosphi = cos
(phi_2
- phi_1
)
158 let sinphi = sin
(phi_2
- phi_1
)
159 let xmid_rt = xmid * cosphi + ymid * -sinphi + h2_tr
160 let ymid_rt = xmid * sinphi + ymid * cosphi + k2_tr
162 if (xmid_rt * xmid_rt) / (a1 * a1) + (ymid_rt * ymid_rt) / (b1
* b1
) > 1.0
170 theta1 <- theta1 - 2.0 * Math.PI
172 let trsign = if theta2 - theta1 > Math.PI then 1.0 else -1.0
174 let mutable area2 = 0.5 * (a2 * b2
* (theta2 - theta1) + trsign * abs
(x1_tr * y2_tr - x2_tr * y1_tr))
178 printf
"TWO area2=%f\n" area2
180 area2 <- area2 + a2 * b2
185 let private threeintpts
(xint
: float[]) (yint
: float[]) (a1: float) (b1
: float) (phi_1
: float) (a2: float) (b2
: float) (h2_tr
: float) (k2_tr
: float) (phi_2
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff: float) : float =
186 let mutable tanpts = 0
187 let mutable tanindex = 0
189 if istanpt
xint.[i
] yint
.[i
] a1 b2 aa bb cc dd ee
ff = TANGENT_POINT
194 printf
"tanindex=%d\n" tanindex
210 twointpts
xint yint
a1 b1 phi_1
a2 b2 h2_tr k2_tr phi_2 aa bb cc dd ee
ff
213 let private fourintpts
(xint: float[]) (yint
: float[]) (a1: float) (b1
: float) (phi_1
: float) (a2: float) (b2
: float) (h2_tr
: float) (k2_tr
: float) (phi_2
: float) (aa
: float) (bb
: float) (cc
: float) (dd
: float) (ee
: float) (ff: float) : float =
216 let area_1 = Math.PI * a1b1
217 let area_2 = Math.PI * a2b2
219 let theta = Array.zeroCreate
4
224 xint.[i
] <- if xint.[i
] < 0.0 then -a1 else a1
225 theta.[i
] <- if yint
.[i
] < 0.0 then 2.0 * Math.PI - acos (xint.[i
] / a1) else acos (xint.[i
] / a1)
229 printf
"k=%d: Theta = %f, xint=%f, yint=%f\n" k
theta.[k
] xint.[k
] yint
.[k
]
237 let mutable k = j
- 1
245 theta.[k+1] <- theta.[k]
246 xint.[k+1] <- xint.[k]
247 yint
.[k+1] <- yint
.[k]
257 printf
"AFTER sorting\n"
259 printf
"k=%d: Theta = %f, xint=%f, yint=%f\n" k theta.[k] xint.[k] yint
.[k]
262 let area1 = 0.5 * abs
((xint.[2] - xint.[0]) * (yint
.[3] - yint
.[1]) - (xint.[3] - xint.[1]) * (yint
.[2] - yint
.[0]))
264 let cosphi = cos
(phi_1
- phi_2
)
265 let sinphi = sin
(phi_1
- phi_2
)
267 let theta_tr = Array.zeroCreate
4
268 let xint_tr = Array.zeroCreate
4
269 let yint_tr = Array.zeroCreate
4
272 xint_tr.[i
] <- (xint.[i
] - h2_tr
) * cosphi + (yint
.[i
] - k2_tr
) * -sinphi
273 yint_tr.[i
] <- (xint.[i
] - h2_tr
) * sinphi + (yint
.[i
] - k2_tr
) * cosphi
275 if abs
xint_tr.[i
] > a2
277 xint_tr.[i
] <- if xint_tr.[i
] < 0.0 then -a2 else a2
279 theta_tr.[i
] <- if yint_tr.[i
] < 0.0 then 2.0 * Math.PI - acos (xint_tr.[i
] / a2) else acos (xint_tr.[i
] / a2)
281 let xmid = a1 * cos
((theta.[0] + theta.[1]) / 2.0)
282 let ymid = b1
* sin
((theta.[0] + theta.[1]) / 2.0)
284 let mutable area2, area3
, area4
, area5
= 0.0, 0.0, 0.0, 0.0
286 if ellipse2tr xmid ymid aa bb cc dd ee
ff < 0.0
288 area2 <- 0.5 * (a1b1 * (theta.[1] - theta.[0]) - abs
(xint.[0] * yint
.[1] - xint.[1] * yint
.[0]))
289 area3
<- 0.5 * (a1b1 * (theta.[3] - theta.[2]) - abs
(xint.[2] * yint
.[3] - xint.[3] * yint
.[2]))
290 area4
<- 0.5 * (a2b2 * (theta_tr.[2] - theta_tr.[1]) - abs
(xint_tr.[1] * yint_tr.[2] - xint_tr.[2] * yint_tr.[1]))
292 if theta_tr.[3] > theta_tr.[0]
294 area5
<- 0.5 * (a2b2 * (theta_tr.[0] - (theta_tr.[3] - 2.0 * Math.PI)) - abs
(xint_tr.[3] * yint_tr.[0] - xint_tr.[0] * yint_tr.[3]))
296 area5
<- 0.5 * (a2b2 * (theta_tr.[0] - theta_tr.[3]) - abs
(xint_tr.[3] * yint_tr.[0] - xint_tr.[0] * yint_tr.[3]))
298 area2 <- 0.5 * (a1b1 * (theta.[2] - theta.[1]) - abs
(xint.[1] * yint
.[2] - xint.[2] * yint
.[1]))
299 area3
<- 0.5 * (a1b1 * (theta.[0] - (theta.[3] - 2.0 * Math.PI)) - abs
(xint.[3] * yint
.[0] - xint.[0] * yint
.[3]))
300 area4
<- 0.5 * (a2b2 * (theta_tr.[1] - theta_tr.[0]) - abs
(xint_tr.[0] * yint_tr.[1] - xint_tr.[1] * yint_tr.[0]))
301 area5
<- 0.5 * (a2b2 * (theta_tr.[3] - theta_tr.[2]) - abs
(xint_tr.[2] * yint_tr.[3] - xint_tr.[3] * yint_tr.[2]))
306 printf
"\n\t\t-------------> area5 is negativ (%f). Add: pi*A2*B2=%f <------------\n" area5
area_2
308 area5
<- area5
+ area_2
313 printf
"\n\t\t-------------> area4 is negativ (%f). Add: pi*A2*B2=%f <------------\n" area4
area_2
315 area4
<- area4
+ area_2
320 printf
"\n\t\t-------------> area3 is negativ (%f). Add: pi*A2*B2=%f <------------\n" area3
area_1
322 area3
<- area3
+ area_1
327 printf
"\n\t\t-------------> area2 is negativ (%f). Add: pi*A2*B2=%f <------------\n" area2 area_1
329 area2 <- area2 + area_1
332 printf
"\narea1=%f, area2=%f area3=%f, area4=%f, area5=%f\n\n" area1 area2 area3 area4 area5
335 area1 + area2 + area3
+ area4
+ area5
338 let private quadroots
(p
: float[]) (r
: float[,]) =
339 let mutable b = -p
.[1] / (2.0 * p
.[0])
340 let c = p
.[2] / p
.[0]
341 let mutable d = b * b - c
362 let private cubicroots
(p
: float[]) (r
: float[,]) =
365 p
.[k] <- p
.[k] / p
.[0]
368 let mutable t = s * p
.[1]
369 let mutable b = 0.5 * (s * (t / 1.5 - p
.[2]) + p
.[3])
370 t <- (t - p
.[2]) / 3.0
371 let mutable c = t * t * t
372 let mutable d = b * b - c
376 d <- ((sqrt
d) + (abs
b)) ** (1.0 / 3.0)
383 d <- sqrt
(0.75) * (b - c)
388 if b > 0.0 && s <= 0.0 || b < 0.0 && s > 0.0
401 then d <- (atan
1.0) / 1.5
402 else d <- atan
((sqrt
-d) / (abs
b)) / 3.0
405 then b <- 2.0 * (sqrt
t)
406 else b <- -2.0 * (sqrt
t)
409 t <- -(sqrt
0.75
) * (sin
d) * b - 0.5 * c
433 let private biquadroots
(p
: float[]) (r
: float[,]) =
437 p
.[k] <- p
.[k] / p
.[0]
440 let b = ref (2.0 * e)
441 let c = ref (!b ** 2.0)
442 let mutable d = 0.75 * !c
443 b := p
.[3] + !b *(!c - p
.[2])
444 let mutable a = p
.[2] - d
445 c := p
.[4] + e * (e * a - p
.[3])
448 let quadExecuted = ref false
456 r
.[j
, k+2] <- r
.[j
, k]
461 r
.[1,k] <- r
.[1,k] - e
465 p.[2] <- (p.[1] * p.[1] - !c) * 0.25
466 p.[3] <- !b * !b / -64.0
472 if r
.[2, k] = 0.0 && r
.[1, k] > 0.0
476 if a >= 0.0 && !b >= 0.0
479 elif
a <= 0.0 && !b <= 0.0
484 b := 0.5 * (a + !b / p.[1])
489 if not
!quadExecuted && p.[2] < 0.0
497 elif not
!quadExecuted
501 b := (sqrt
p.[2]) * 2.0 + p.[1]
503 b := -(sqrt
p.[2]) * 2.0 + p.[1]
516 // Return a tuple (area, x intersections, y intersections)
517 let EEOverlapArea (e1
: Types.Ellipse) (e2
: Types.Ellipse) : (float * float[] * float[]) option =
518 let h1, k1
, a1, b1
, phi_1
= e1
.Cx, e1
.Cy, e1
.A, e1
.B, e1
.Alpha
519 let h2, k2, a2, b2
, phi_2
= e2
.Cx, e2
.Cy, e2
.A, e2
.B, e2
.Alpha
521 if a1 <= EPS || b1 <= EPS || a2 <= EPS || b2 <= EPS
525 let phi_1 = phi_1 % Math.PI //(if phi_1 > Math.PI / 2.0 then phi_1 - Math.PI else phi_1) % Math.PI
526 let phi_2 = phi_2 % Math.PI //(if phi_2 > Math.PI / 2.0 then phi_2 - Math.PI else phi_2) % Math.PI
527 let h2_tr, k2_tr
, phi_2r
=
528 let cosphi = cos
phi_1
529 let sinphi = sin
phi_1
530 (h2 - h1) * cosphi + (k2 - k1
) * sinphi, (h1 - h2) * sinphi + (k2 - k1
) * cosphi, (phi_2 - phi_1) % (2.0 * Math.PI)
533 printf
"H2_TR=%f, K2_TR=%f, PHI_2R=%f\n" h2_tr k2_tr phi_2r
536 let cosphi = cos
phi_2r
537 let cosphi2 = cosphi ** 2.0
538 let sinphi = sin
phi_2r
539 let sinphi2 = sinphi ** 2.0
540 let cosphisinphi = 2.0 * cosphi * sinphi
543 let tmp0 = (cosphi * h2_tr + sinphi * k2_tr
) / a22
544 let tmp1 = (sinphi * h2_tr - cosphi * k2_tr
) / b22
545 let tmp2 = cosphi * h2_tr + sinphi * k2_tr
546 let tmp3 = sinphi * h2_tr - cosphi * k2_tr
548 let aa = cosphi2 / a22 + sinphi2 / b22
549 let bb = cosphisinphi / a22 - cosphisinphi / b22
550 let cc = sinphi2 / a22 + cosphi2 / b22
551 let dd = -2.0 * cosphi * tmp0 - 2.0 * sinphi * tmp1
552 let ee = -2.0 * sinphi * tmp0 + 2.0 * cosphi * tmp1
553 let ff = tmp2 * tmp2 / a22 + tmp3 * tmp3 / b22 - 1.0
556 (a1 * (a1 * aa - dd) + ff) * (a1 * (a1 * aa + dd) + ff)
557 2.0 * b1 * (a1 * a1 * (aa * ee - bb * dd) + ee * ff)
558 a1 * a1 * ((b1 * b1 * (2.0 * aa * cc - bb * bb) + dd * dd - 2.0 * aa * ff) - 2.0 * a1 * a1 * aa * aa) + b1 * b1 * (2.0 * cc * ff + ee * ee)
559 2.0 * b1 * (b1 * b1 * cc * ee + a1 * a1 * (bb * dd - aa * ee))
560 a1 * a1 * a1 * a1 * aa * aa + b1 * b1 * (a1 * a1 * (bb * bb - 2.0 * aa * cc) + b1 * b1 * cc * cc)
565 printf
"cy[%d]=%f\n" i
cy.[i
]
568 let py = Array.zeroCreate
<float> 5
569 let r = Array2D.zeroCreate
<float> 3 5
575 py.[4-i
] <- cy.[i
] / cy.[4]
579 printf
"py[%d]=%f\n" i
py.[i
]
584 elif abs
cy.[3] > EPS
587 py.[3 - i
] <- cy.[i
] / cy.[3]
592 elif abs
cy.[2] > EPS
595 py.[2-i
] <- cy.[i
] / cy.[2]
600 elif abs
cy.[1] > EPS
602 r.[1, 1] <- -cy.[0] / cy.[1]
610 printf
"nroots = %d\n" nroots
614 for i
in 1 .. nroots do
615 if abs
r.[2, i
] < EPS
619 printf
"ROOT is Real, i=%d --> %f (B1=%f)\n" i
r.[1, i
] b1
622 Array.sortInPlace
ychk
625 printf
"nychk=%d\n" ychk.Length
626 for j
in 0 .. ychk.Length - 1 do
627 printf
"\t j=%d, ychk=%f\n" j ychk.[j]
630 let nychk = Array.length
ychk
631 let mutable nintpts = 0
633 let xint = Array.zeroCreate
4
634 let yint = Array.zeroCreate
4
636 let mutable returnValue = 0.0
639 while returnValue = 0.0 && i < nychk do
641 printf
"------------->i=%d (nychk=%d)\n" i nychk
644 if not
(i < nychk - 1 && abs
(ychk.[i] - ychk.[i+1]) < EPS / 2.0)
647 printf
"check intersecting points. nintps is %d" nintpts
650 let x1 = if abs
ychk.[i] > b1 then 0.0 else a1 * sqrt
(1.0 - (ychk.[i] * ychk.[i]) / (b1 * b1))
654 printf
"\tx1=%f, y1=%f, A=%f. B=%f ---> ellipse2tr(x1)= %f\n" x1 ychk.[i] a1 b1 (ellipse2tr x1 ychk.[i] aa bb cc dd ee ff)
655 printf
"\tx2=%f, y1=%f, A=%f. B=%f ---> ellipse2tr(x2) %f\n" x2 ychk.[i] a1 b1 (ellipse2tr x2 ychk.[i] aa bb cc dd ee ff)
658 if abs
(ellipse2tr x1 ychk.[i] aa bb cc dd ee ff) < EPS
660 nintpts <- nintpts + 1
662 printf
"first if x1. acc nintps=%d\n" nintpts
668 xint.[nintpts-1] <- x1
669 yint.[nintpts-1] <- ychk.[i]
671 printf
"nintpts=%d, xint=%f, x2=%f, i=%d, yint=%f\n" nintpts x1 x2 i ychk.[i]
674 if returnValue <> -1.0 && abs
(ellipse2tr x2 ychk.[i] aa bb cc dd ee ff) < EPS && abs
(x2 - x1) > EPS
676 nintpts <- nintpts + 1
678 printf
"first if x2. nintps=%d, Dx=%f (eps2=%f) \n" nintpts (abs
(x2 - x1)) EPS
684 xint.[nintpts-1] <- x2
685 yint.[nintpts-1] <- ychk.[i]
688 printf
"nintpts=%d, x1=%f, xint=%f, i=%d, yint=%f\n" nintpts x1 x2 i ychk.[i]
693 printf
"i=%d, multiple roots: %f <--------> %f. continue\n" i ychk.[i] ychk.[i-1]
698 if returnValue = -1.0
704 | 0 | 1 -> nointpts
a1 b1 a2 b2 h1 k1
h2 k2 phi_1 phi_2 h2_tr k2_tr
aa bb cc dd ee ff
705 | 2 -> match istanpt
xint.[0] yint.[0] a1 b1 aa bb cc dd ee ff with
708 printf
"one point is tangent\n"
710 nointpts
a1 b1 a2 b2 h1 k1
h2 k2 phi_1 phi_2 h2_tr k2_tr
aa bb cc dd ee ff
712 | INTERSECTION_POINT ->
714 printf
"check twointpts\n"
716 twointpts
xint yint a1 b1 phi_1 a2 b2 h2_tr k2_tr
phi_2 aa bb cc dd ee ff
717 | 3 -> threeintpts
xint yint a1 b1 phi_1 a2 b2 h2_tr k2_tr
phi_2 aa bb cc dd ee ff
718 | 4 -> fourintpts
xint yint a1 b1 phi_1 a2 b2 h2_tr k2_tr
phi_2 aa bb cc dd ee ff
721 then Some (area, [||], [||])
723 let xTransform = Array.zeroCreate
nintpts
724 let yTransform = Array.zeroCreate
nintpts
725 for i in 0 .. (nintpts - 1) do
726 xTransform.[i] <- cos
phi_1 * xint.[i] - sin
phi_1 * yint.[i] + h1
727 yTransform.[i] <- sin
phi_1 * xint.[i] + cos
phi_1 * yint.[i] + k1
728 Some (area, xTransform, yTransform)