-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcircle.py
More file actions
204 lines (157 loc) · 7.02 KB
/
circle.py
File metadata and controls
204 lines (157 loc) · 7.02 KB
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
"""module docstring should be here"""
import math
import numpy as np
import check
from epsilon import epsilon_distance, zero_in_practice, equal_in_practice
from error_array import get_indices_around_minimum_abs_error
from formatting import format_float
from typing import Final, Sequence, TypeAlias
Number: TypeAlias = int | float
TupleOf2Floats: TypeAlias = tuple[float, float]
TupleOf2Numbers: TypeAlias = tuple[Number, Number]
def as_tuple_of_2_floats(a: np.ndarray) -> TupleOf2Floats:
# Ensure the input has exactly two elements
if len(a) != 2:
raise ValueError("The input array-like must have exactly two elements.")
# Convert each element to float if possible
try:
result: Final = float(a[0]), float(a[1])
except ValueError:
raise ValueError("Both elements of the input array-like must be convertible to floats.")
return result
class Circle(object):
center: Final[TupleOf2Floats]
radius: Final[float]
def __new__(cls, center: TupleOf2Numbers, radius: Number) -> 'Circle':
check.tuple_type(center)
check.length_is_equal_to_n(center, 2)
if radius <= 0:
raise ValueError(f'Radius value {format_float(radius)} is out of range')
return object.__new__(cls)
def __init__(self, center: TupleOf2Numbers, radius: Number) -> None:
self.center = float(center[0]), float(center[1])
self.radius = float(radius)
def __eq__(self, other, epsilon: float = epsilon_distance) -> bool:
return \
equal_in_practice(self.center[0], other.center[0], epsilon) \
and equal_in_practice(self.center[1], other.center[1], epsilon) \
and equal_in_practice(self.radius, other.radius, epsilon)
def __str__(self) -> str:
c_x: Final[str] = format_float(self.center[0])
c_y: Final[str] = format_float(self.center[1])
r: Final[str] = format_float(self.radius)
return f'Circle(center=({c_x}, {c_y}), radius={r})'
def get_radius(self) -> float:
return self.radius
def get_center(self) -> TupleOf2Floats:
return self.center
def spy(self, message: str) -> None:
print(f'{message}: {self}')
def get_signed_distance_to_circumference(self, point: TupleOf2Numbers) -> float:
point_in_np: Final = np.array(point, np.float64)
return float(np.linalg.norm(self.center - point_in_np)) - self.radius
def point_is_on_circumference(self, point: TupleOf2Numbers) -> bool:
distance: Final = self.get_signed_distance_to_circumference(point)
return zero_in_practice(distance)
def get_mse(self, points: Sequence[TupleOf2Numbers]) -> float:
check.arrangement_type(points)
check.not_empty(points)
acc_squared_error: float = 0
for point in points:
error = self.get_signed_distance_to_circumference(point)
squared_error = error*error
acc_squared_error += squared_error
return acc_squared_error / len(points)
def get_mean_signed_distance(self, points: Sequence[TupleOf2Numbers]) -> float:
check.arrangement_type(points)
check.not_empty(points)
acc_signed_distance: float = 0
for point in points:
acc_signed_distance += self.get_signed_distance_to_circumference(point)
return acc_signed_distance / len(points)
def get_circle(points: Sequence[TupleOf2Numbers]) -> Circle:
"""
Code adapted from https://stackoverflow.com/questions/52990094
on February 18, 2019
"""
check.arrangement_type(points)
check.length_is_equal_to_n(points, 3)
a = np.zeros((3, 3))
for i in range(0, 3):
a[i][0] = points[i][0]
a[i][1] = points[i][1]
a[i][2] = 1
determinant: Final = np.linalg.det(a)
if zero_in_practice(determinant):
raise ArithmeticError('It is impossible to divide by zero')
temp: Final = points[1][0]**2 + points[1][1]**2
bc: Final = (points[0][0]**2 + points[0][1]**2 - temp) / 2
cd: Final = (temp - points[2][0]**2 - points[2][1]**2) / 2
# Center of circle
x: Final = (bc*(points[1][1] - points[2][1]) - cd*(points[0][1] - points[1][1])) / determinant
y: Final = ((points[0][0] - points[1][0]) * cd - (points[1][0] - points[2][0]) * bc) / determinant
center: Final[TupleOf2Floats] = x, y
radius: Final = math.sqrt((x - points[0][0]) ** 2 + (y - points[0][1]) ** 2)
return Circle(center, radius)
def get_y_min_and_y_max(points: Sequence[TupleOf2Numbers], x_center: Number, radius: Number) -> TupleOf2Floats:
"""
Solving these equations:
(x - x_p)^2 + (y - y_p)^2 = R^2, and
line x = x_center
we reach
y = y_p +- sqrt(R^2 - (x_center - x_p)^2)
Hence, we can establish
y_min = min { y_p - sqrt(R^2 - (x_center - x_p)^2) } for all point p, and
y_max = max { y_p - sqrt(R^2 + (x_center - x_p)^2) } for all point p
"""
y_min = float("inf")
y_max = -float("inf")
r_times_r: Final = radius**2
for point in points:
discriminant = r_times_r - (x_center - point[0])**2
if zero_in_practice(discriminant):
continue
if discriminant < 0:
raise ValueError('The given radius is too small to reach point')
sqrt_discriminant = math.sqrt(discriminant)
y_min = min(y_min, point[1] - sqrt_discriminant)
y_max = max(y_max, point[1] + sqrt_discriminant)
return y_min, y_max
def get_best_fit_circle(points: Sequence[TupleOf2Numbers], x_center: Number, radius: Number, use_mse: bool,
num_samples: int) -> Circle: # num_samples = 9):
check.arrangement_type(points)
check.length_is_greater_than_n(points, 3)
y_min, y_max = get_y_min_and_y_max(points, x_center, radius)
y = [0.] * num_samples
error = [0.] * num_samples
done = False
i = 0
idx_min = 0
while not done:
delta = (y_max - y_min)/(num_samples - 1.)
for j in range(num_samples):
y[j] = y_min + delta*j
circle = Circle((x_center, y[j]), radius)
error[j] = circle.get_mse(points) if use_mse else circle.get_mean_signed_distance(points)
# print(f'i = {i}, j = {j} | y = {y[j]} | error = {error[j]}')
if zero_in_practice(error[j]):
return circle
idx_min, idx_max = get_indices_around_minimum_abs_error(error)
y_min, y_max = y[idx_min], y[idx_max]
# print(f"idx_min = {idx_min}, idx_max = {idx_max}, y range: {y_min} {y_max}")
i = i + 1
done = equal_in_practice(y[idx_min], y[idx_max]) or equal_in_practice(error[idx_min], error[idx_max]) or i == 50
return Circle((x_center, y[idx_min]), radius)
def main():
center: Final[TupleOf2Floats] = 1.1111, 2.2222
radius: Final = 3.3333
circle = Circle(center, radius)
print(f'circle is {circle}')
circle.spy('Spying circle')
try:
negative_radius: Final = -1.23456
Circle(center, negative_radius)
except ValueError as error:
print(f'ValueError exception caught, as expected: {error}')
if __name__ == '__main__':
main()