pith. sign in

arxiv: 1105.4130 · v1 · pith:DEPLJF7Cnew · submitted 2011-05-20 · 💻 cs.CG

On 2-Site Voronoi Diagrams under Geometric Distance Functions

classification 💻 cs.CG
keywords distancefunctionsvoronoidiagramsgeometricpointanalyzecomplexity
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.