By Topic

An optimal algorithm to construct all Voronoi diagrams for k nearest neighbor search in T2

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. J. De Rezende ; Inst. de Comput., Univ. Estadual de Campinas, Sao Paulo, Brazil ; R. B. Westrupp

We generalize to the oriented projective plane T2 an algorithm for constructing all order k Voronoi diagrams in the Euclidean plane. We also show that, for fixed k and for a finite set of sites, an order k Voronoi diagram in T2 has an exact number of regions. Furthermore, we show that the order k Voronoi diagram of a set of n sites in T2 is antipodal to its order n-k Voronoi diagram, ∀k: 1⩽k<n

Published in:

Computer Graphics and Image Processing, 1999. Proceedings. XII Brazilian Symposium on

Date of Conference: