Detailed Information
Cited 0 time in 
Cited 32 time in 
Cited 32 time in
Metadata Downloads
Farthest-polygon Voronoi diagrams
- Authors
- Cheong, Otfried; Everett, Hazel; Glisse, Marc; Gudmundsson, Joachim; Hornus, Samuel; Lazard, Sylvain; Lee, Mira; Na, Hyeon-Suk
- Issue Date
- May-2011
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Voronoi diagram
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.44, no.4, pp.234 - 247
- Journal Title
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
- Volume
- 44
- Number
- 4
- Start Page
- 234
- End Page
- 247
- ISSN
- 0925-7721
- Abstract
- Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log(3) n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k - 1 connected components, but if one component is bounded, then it is equal to the entire region. (C) 2010 Elsevier B.V. All rights reserved.
- Files in This Item
- Go to Link
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Na, Hyeon-Suk
- College of Information Technology (School of Computer Science and Engineering)