The Computation of the Voronoi Diagram of a Circle Set Using the Voronoi Diagram of a Point Set: II. Geometry

점 집합의 보로노이 다이어그램을 이용한 원 집합의 보로노이 다이어그램의 계산: II.기하학적 측면

  • ;
  • ;
  • ;
  • Kokichi Sugihara (University of Tokyo, Department of Mathematical Engineering and Information Physics)
  • Published : 2001.03.01

Abstract

Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

Keywords

References

  1. A History of Mathematics Boyer,C.B
  2. What is Mathematics?: An Elementary Approach to Ideas and Methods(2nd edition) Courant,R;Robbins,H
  3. 100 Great Problems of Elementary Mathematics:Their History and Solutions Dorrie,H
  4. Proceedings of the 16th Annual Allection Conference on Communications,Control and Computing Generalized Voronoi diagram in the plane Drysdale,R.L;Lee,D.T
  5. Generalized Voronoi diagrams and geometric searching Drysdale,R.L
  6. Curves and Surfaces for Computer-Aided Geometric Design:A Practical Guide(4th Ed) Farin,G
  7. NURBS:From Projective Geometry to Practical Use.(2nd ed) Farin,G
  8. Algorithmica v.2 Sweepline Algorithm for Voronoi Diagrams Fortune,S.A
  9. Computer-Aided Design v.28 no.6/7 A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves Hamann,B;Tsai,P.-Y.A
  10. LNCS On the Computational Geometry of Pocket Machining Held,M
  11. Computer-Aided Design v.26 no.3 Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps Held,M;Lukacs,G;Andor,I
  12. Modern Geometry:An Elementary Treatise on the Geometry of the Triangle and the Circle Johnson,R.A
  13. Computer-Aided Design v.27 no.8 Representing the Voronoi diagram of a simple polygon using rational quadratic Bezier curves Kim,D.-S.Hwnag,I.-K;Park,B.-J
  14. Computer-Aided Design v.30 no.14 Polygon offsetting using a Voronoi diagram and two stacks Kim,D.-S
  15. Computer-Aided Design v.30 no.13 A cocktail algorithm for planar Bezier curve intersecting Kim,D.-S;Lee,S.-W;Shin,H
  16. 한국 CAD/CAM학회 논문집 v.3 no.2 유리Bezier 곡선과 곡면의 호도그래프 김덕수;장태범;조영송
  17. 한국 CAD/CAM 학회 논문집 v.6 no.1 점 집합의 보로노이 다이어그램과 원집합의 보로노이 다이어그램의 관계: I.위상적 측면 김동욱;김덕수;조동수
  18. Advanced Engineering Mathematics(7th Edition) Kreyszig,E
  19. SIAM J.COMPUT v.10 no.1 Generalization of Voronoi diagrams in the plane Lee,D.T;Drysdale,R.L
  20. An introduction to solid modeling Mantyla,M
  21. Spatial Tessellations Concepts and Applications of Voronoi Diagram Okabe,A;Boots,B;Sugihara,K
  22. Computer-Aided Design v.10 no.3 NC machining of arbitrarily shaped pockets Persson,H
  23. Computational Geometry:An Introduction Preparata,F.P;Shamos,M.I
  24. SIAM J.COMPUT v.14 no.2 Intersection and closest-pair problems for a set of planar discs Sharir,M
  25. Graphical Models and Image Processing v.55 no.6 Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams Sugihara,K
  26. http://www.simplex.t.u-tokyo.ac.jp/~sugihara/ Sugihara,K