Back to Search Start Over

Cover Ratio of Absolute Neighbor.

Authors :
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Pandu Rangan, C.
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Nakano, Shin-ichi
Rahman, Md. Saidur
Onishi, Kensuke
Hoshi, Mamoru
Source :
WALCOM: Algorithms & Computation; 2008, p70-80, 11p
Publication Year :
2008

Abstract

Voronoi diagrams for a fix set of generators are considered with varying Lp norm. For a generator q in the set, the absolute neighbor of q is defined to be the intersection of all Voronoi regions of q by Lp norm(pā€‰=ā€‰1, 2...,ā€‰āˆž). Since the shape of Voronoi region is dependent on the norm used, the collection of absolute neighbors for the set does not always cover the whole space. In this paper, we construct absolute neighbors and computed the ratio, called cover ratio, of the volume covered by all absolute neighbors to that of the whole space for some sets of generators by computational experiments. Computational experiments show that the cover ratio is higher when a configuration of grid points is used as a set of generators than when a set of random generators is used. Moreover, we theoretically show that the absolute neighbors for square configuration and for face-centered configuration cover the whole space. We also discuss an application of absolute neighbors to constructing an index structure of the whole space for efficient retrieval. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540778905
Database :
Complementary Index
Journal :
WALCOM: Algorithms & Computation
Publication Type :
Book
Accession number :
34227080
Full Text :
https://doi.org/10.1007/978-3-540-77891-2_7