2007 2007

3 JOURNAL OF ENGINEERING GRAPHICS No.3

100084

-
-
1/-1/
-1/ 1/-
-

-
TP 391
A 1003-0158(2007)03-0097-05

Algorithm for Minimum Circumscribed Circle Detection Based on

Computational Geometry Technique

ZHANG Yong, CHEN Qiang

( Key Laboratory for Advanced Manufacturing by Materials Processing Technology,

Department of Mechanical Engineering, Tsinghua University, Beijing 100084, China )

Abstract: -hulls are applied to calculate the minimum circumscribed circle (MCC) of point
set and an accurate and effective method for MCC detection is established through finding the
least squares circle of the point set and iteratively approaching the MCC with recursive
subdivision. Several theorems concerning the properties of -hulls are presented. If 1/ is equal to
the radius of points MCC, all vertices of the -hull will be on the same circle. When 1/ is larger
than the MCCs radius, the number of vertices of -hulls will decrease with decreasing of 1/, and
the number of vertices number will reach zero when 1/ is smaller than MCCs radius. From the
above rules, an algorithm for detecting MCC is developed, and experimental results show this
algorithm is reliable.

Key words: computer application; optimized algorithm; computational geometry; minimum

circumscribed circle; -hull

2005-12-20
5027508320020003053
1976-
98 2007

P P 1/ =0
P P - P <0 P -
A B B P -1/
A A 2 3 -

1/ =0

20 70 (a) (b)
[1][2] Voronoi
Voronoi
-

1 --hull
-1/ -1/
[3] P -
-- (c) (d)
--disc 1 (a) >0; (b) =0; (c, d) <0
1 2 -
>0 - 1/
-

1 >0 P
=0 -
1/

P P -
<0 --1/

2 <0 P
-1/
P
P -
[4][5]
-
O(n)
>0 =0 <0

1 - 2
- -
2 P
P - P - 1 P P
P -- C0 R0R
2 >0 P - R>R0 P C0
 3 99

P -1/ =R
A
p P
p R0
C1
P R >R0 p
R P
C2
- p P -1/ = R C3

1
2 P P
B
C0 R0R
R<R0 P -1/ = R
3 3
P -1/ =R
p -- p P1
p R C p R1
P C P C1 P
R P R0 P C1
R<R0 R1<R2, p
2 R2 C2 C1
3 P C1 C2
P
3 P P C2
C1 C2 R1 R2 C1 C2 P p C2
C2 P R1=R2 p P 2-1/2=R2
C1 C2 p P2
C1 p P1 P1
C2 A B C1 C2 P2
P P C1 P C2 P1 P2
P (C1C2) 4
3 AB C3 4 P
1/ R2 R1 P -
(C1C2) C3
5 P R0 P
P C3 P -1/ =R0
C3 P
|AB|<2R1 C3 C1C2 p P -1/ =R0
C1C2 p R0
C P R0 P
3 3 C P
4 P P1 p P
P2 P 1-1/1=R12- P -1/ =R0 P
1/2=R2R0 P
0<R0R1<R2,P1 P2 5
 100 2007

5
3 -[4]
O(n)
1~5 m - m
P={p1, p2, , pm}P R0 2m-m P m
rP -1/ =r -- m1
n r m2mk mk=2 3 mm1m2
1 r =+n P mk n
2 r>R0 r n n = 2m m1 + 2m1 m2 + 2m2 m3 + " + 2mk 1 mk =
3 r =R0 -1/ =r 2m + m1 + m2 + " + mk 1 + mk 2m + m( m 1) / 2

4 r <R0 n=0
4
n r P
-1/ =r r
R0 r
P -1/ =r-1/ =r
P PIII733
MATLAB 1


1
P={p1, p2, , pm}
P R0
C0 (ms) (ms)
1 P C 1 510.7197 5197 510.7195 205
P C ra rb 2 509.2613 5239 509.2612 251
2 r =rbP=P 3 509.8364 4998 509.8363 210
3 P-1/ =r 4 510.3728 5034 510.3728 196
P1 5 508.6153 4686 508.6150 222
4 P1 r =(ra+rb)/2ra=(ra+ 6 508.3690 5150 508.3689 188
rb)/2 3 5 7 509.4598 4623 509.4597 310
5 P1 P 8 510.7606 5266 510.7604 406
C0 R0 R0 C0 9 507.9658 4962 507.9658 290
6 10 511.2469 5067 511.2466 305
6 r =(ra+rb)/2rb=(ra+rb)/2P=P1
3 2
- 445
- ra=513.0609
3 rb=504.8399 1/-
5 4 6 3 2
3 12 1/ =510.7207
- 3
4 506.1752-42.8304
-462.9598-211.3977

510.633553.1987 3
 3 101

510.7195 2.9206 2 1/ <R0 -

-2.1373 3 1/ >R0 1/
-
1 1/-
-
1/
1 513.0609 11
2 508.9504 0
3 511.0057 6
4 509.9780 0
5 510.4918 0 [1] Samuel G L, Shunmugam M S. Evaluation of
6 510.7488 5 circularity from coordinate and form data using
7 510.6203 0 computational geometric techniques [J]. Precision
8 510.6845 0 Engineering, 2000, 24(3): 251-263.
9 510.7166 0 [2] , , .
10 510.7327 4 [J]. ,
11 510.7247 4 2000, 21(3): 83-89.
12 510.7207 3 [3] Herbert Edelsbrunner. Algorithms in combinatorial
geometry [M]. Berlin: Springer-Verlag, 1987.
309-315.
5
[4] Olivier D, Franco P P. Culling a set of points for
- roundness or cylindricity evaluations [J]. International
- Journal of Computational Geometry, 2003, 13(2):
R01/ 231-240.
- [5] Graham R L. An efficient algorithm for determining
1 1/ =R0 - the convex hull of a finite planar set [J]. Information
Processing Letter, 1972, 2(1): 132-133.