By Topic

On 2-Site Voronoi Diagrams under Geometric Distance Functions

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

5 Author(s)
Gill Barequet ; Dept. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa, Israel ; Matthew T. Dickerson ; David Eppstein ; David Hodorkovsky
more authors

We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the nearest- and furthest-neighbor Voronoi diagrams of a point set with respect to these distance functions.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2011 Eighth International Symposium on

Date of Conference:

28-30 June 2011