scholarly journals Voronoi diagrams for convex polygon-offset distance functions

2001 ◽  
Vol 25 (2) ◽  
pp. 271-291 ◽  
Author(s):  
G. Barequet ◽  
M. T. Dickerson ◽  
M. T. Goodrich
Keyword(s):  
Convex Polygon ◽  
Voronoi Diagrams ◽  
Distance Functions ◽  
Offset Distance

scholarly journals Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions

1998 ◽  
Vol 19 (4) ◽  
pp. 485-519 ◽  
Author(s):  
J.-D. Boissonnat ◽  
M. Sharir ◽  
B. Tagansky ◽  
M. Yvinec
Keyword(s):  
Voronoi Diagrams ◽  
Higher Dimensions ◽  
Distance Functions

scholarly journals Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions

1998 ◽  
Vol 29 (2) ◽  
pp. 238-255 ◽  
Author(s):  
L.Paul Chew ◽  
Klara Kedem ◽  
Micha Sharir ◽  
Boaz Tagansky ◽  
Emo Welzl
Keyword(s):  
Voronoi Diagrams ◽  
Distance Functions ◽  
Polyhedral Convex ◽  
Convex Distance Functions

scholarly journals On 2-Site Voronoi Diagrams under Geometric Distance Functions

2011 ◽  
Author(s):  
Gill Barequet ◽  
Matthew T. Dickerson ◽  
David Eppstein ◽  
David Hodorkovsky ◽  
Kira Vyatkina
Keyword(s):  
Voronoi Diagrams ◽  
Distance Functions ◽  
Geometric Distance

scholarly journals Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions

2015 ◽  
Vol 54 (4) ◽  
pp. 871-904 ◽  
Author(s):  
Pankaj K. Agarwal ◽  
Haim Kaplan ◽  
Natan Rubin ◽  
Micha Sharir
Keyword(s):  
Voronoi Diagrams ◽  
Distance Functions ◽  
Delaunay Triangulations

SKEW VORONOI DIAGRAMS

1999 ◽  
Vol 09 (03) ◽  
pp. 235-247 ◽  
Author(s):  
OSWIN AICHHOLZER ◽  
FRANZ AURENHAMMER ◽  
DANNY Z. CHEN ◽  
D. T. LEE ◽  
EVANTHIA PAPADOPOULOU
Keyword(s):  
Euclidean Distance ◽  
Voronoi Diagrams ◽  
Nearest Neighbors ◽  
Distance Functions ◽  
Plane Sweep ◽  
Voronoi Regions ◽  
Convex Distance Functions ◽  
Tilted Plane ◽  
Three Space

On a tilted plane T in three-space, skew distances are defined as the Euclidean distance plus a multiple of the signed difference in height. Skew distances may model realistic environments more closely than the Euclidean distance. Voronoi diagrams and related problems under this kind of distances are investigated. A relationship to convex distance functions and to Euclidean Voronoi diagrams for planar circles is shown, and is exploited for a geometric analysisis and a plane-sweep construction of Voronoi diagrams on T. An output-sensitive algorithm running in time O(n  log  h) is developed, where n and h are the numbers of sites and non-empty Voronoi regions, respectively. The all nearest neighbors problem for skew distances, which has certain features different from its Euclidean counterpart, is solved in O(n  log  n) time.

Sign in / Sign up

Export Citation Format

Share Document