Back to Search
Start Over
Furthest Site Abstract Voronoi Diagrams.
- Source :
-
International Journal of Computational Geometry & Applications . Dec2001, Vol. 11 Issue 6, p583. 34p. - Publication Year :
- 2001
-
Abstract
- Voronoi diagrams were introduced by R. Klein as a unifying approach to Voronoi diagrams. In this paper we study furthest site abstract Voronoi diagrams and give a unified mathematical and algorithmic treatment for them. In particular, we show that furthest site abstract Voronoi diagrams are trees, have linear size, and that, given a set of n sites, the furthest site abstract Voronoi diagram can be computed by a randomized algorithm in expected time O(n log n). [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 11
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 7144747
- Full Text :
- https://doi.org/10.1142/S0218195901000663