Abstract
Robust and fast computation of the exact Voronoi diagram of circle set is difficult. Presented in this paper is an edge-flipping algorithm that computes a circle set Voronoi diagram using a point set Voronoi diagram, where the points are the centers of circles. Hence, the algorithm is as robust as its counterpart of point set. Even though the theoretical worst-case time complexity is quadratic, the actual performance shows a strong linear time behavior for various test cases. Furthermore, the computation time is comparable to the algorithm of point set Voronoi diagram itself.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Drysdale, R. L. III, Generalized Voronoi diagrams and geometric searching, Ph.D. Thesis, Department of Computer Science, Tech. Rep. STAN-CS-79-705, Stanford University, Stanford CA (1979).
Drysdale, R. L. III, and Lee, D. T, Generalized Voronoi diagram in the plane, Proceedings of the 16th Annual Allerton Conference on Communications, Control and Computing, Oct. (1978) 833–842.
Farin, G., Curves and Surfaces for Computer-Aided Geometric Design: A Practical Guide, 4th edition, Academic Press, San Diego (1996).
Fortune, S., A sweepline algorithm for Voronoi diagrams, Algorithmica, Vol. 2 (1987) 153–174.
Gavrilova, M. and Rokne, J., Swap conditions for dynamic Voronoi diagram for circles and line segments, Computer Aided Geometric Design, Vol. 16 (1999) 89–106.
Gavrilova, M., Ratschek, H. and Rokne, J., Exact computation of Delaunay and power triangulations, Reliable Computing, Vol. 6 (2000) 39–60.
Hamann, B. and Tsai, P.-Y., A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves, Computer-Aided Design, Vol. 28, No. 6/7 (1996) 461–472.
Held, M., On the Computational Geometry of Pocket Machining, LNCS, Springer-Verlag (1991).
Held, M., Luk’acs, G. and Andor, L., Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps, Computer-Aided Design, Vol.26, No. 3 (1994) 189–203.
Kim, D.-S., Hwang, I.-K. and Park, B.-J., Representing the Voronoi diagram of a simple polygon using rational quadratic Bézier curves, Computer-Aided Design, Vol. 27, No. 8 (1995) 605–614.
Kim, D.-S., Kim, D., Sugihara, K., Ryu, J., Apollonius tenth problem as a Point Location Problem, (Submitted to ICCS 2001).
Kim, D.-S., Kim, D., and Sugihara, K., Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry, (Submitted to Computer Aided Geometric Design).
Lee, D. T. and Drysdale, R. L. III, Generalization of Voronoi diagrams in the plane, SIAM J. COMPUT., Vol. 10, No. 1, February (1981) 73–87.
Mäntylä, M., An introduction to solid modeling, Computer Science Press (1988).
Okabe, A., Boots, B. and Sugihara, K., Spatial Tessellations Concepts and Applications of Voronoi Diagram, John Wiley & Sons (1992).
Persson, H., NC machining of arbitrarily shaped pockets, Computer-Aided Design, Vol. 10, No. 3 (1978) 169–174.
Preparata, F. P. and Shamos, M. I. Computational Geometry An Introduction Springer-Verlag (1985).
Sharir, M., Intersction and closest-pair problems for a set of planar discs, SIAM J. COMPUT., Vol. 14, No. 2 (1985) 448–468.
Sugihara, K., Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams, Graphical Models and Image Processing, Vol. 55, No. 6 (1993) 522–531.
Sugihara, K., Experimental study on acceleration of an exact-arithmetic geometric algorithm, Proceedings of the IEEE International Conference on Shape Modeling and Applications (1997) 160–168.
Sugihara, K. and Iri, M., Construction of the Voronoi diagram for one million generators in single-precision arithmetic, Proc. IEEE 80 (1992) 1471–1484.
Sugihara, K., http://www.simplex.t.u-tokyo.ac.jp/~sugihara/, (2000).
Yap, C. K., An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete Comput. Geom., Vol. 2 (1987) 365–393.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, DS., Kim, D., Sugihara, K., Ryu, J. (2001). Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_83
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive