A sweepline algorithm for Euclidean Voronoi diagram of circles
- Authors
- Jin, Li; Kim, Donguk; Mu, Lisen; Kim, Deok Soo; Hu, Shi-Min
- Issue Date
- Mar-2006
- Publisher
- ELSEVIER SCI LTD
- Keywords
- Euclidean Voronoi diagram; circle; sweepline; event; beach line
- Citation
- COMPUTER-AIDED DESIGN, v.38, no.3, pp.260 - 272
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTER-AIDED DESIGN
- Volume
- 38
- Number
- 3
- Start Page
- 260
- End Page
- 272
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181689
- DOI
- 10.1016/j.cad.2005.11.001
- ISSN
- 0010-4485
- Abstract
- Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bottom. While moving on the plane, the sweepline stops only at certain event points where the topology changes occur for the Voronoi diagram being constructed. The worst-case time complexity of the proposed algorithm is O((n + m)log n), where it is the number of input circles, and in is the number of intersection points among circles. As in can be O(n(2)), the presented algorithm is optimal with O(n(2) log n) worst-case time complexity. (c) 2005 Elsevier Ltd. All rights reserved.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181689)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.