| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428097 | Information Processing Letters | 2009 | 4 Pages |
Abstract
In this paper, we introduce the fuzzy Voronoi diagram as an extension of the Voronoi diagram. We assume Voronoi sites to be fuzzy points and then define the Voronoi diagram for this kind of sites, then we provide an algorithm for computing this diagram based on Fortune's algorithm which costs O(nlogn) time. Also we introduce the fuzzy Voronoi diagram for a set of fuzzy circles, rather than fuzzy points, of the same radius. We prove that the boundary of this diagram is formed by the intersection of some hyperbolae, and finally we provide an O(n3logn)-time algorithm to compute the boundary.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
