by Christian Icking, Rolf Klein, Ngoc-minh Lê, Lihong Ma, Francisco Santos
In Proc. 11th Canad. Conf. Comput. Geom
http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf
Add To MetaCart
Abstract:
We investigate the structure of the bisector of point sites under arbitrary convex distance functions in three dimensions. Our results show that it is advantageous for analyzing bisectors to consider their central projection on the unit sphere, thereby reducing by one the dimension of the problem. From the concept of “silhouettes ” and their intersections we obtain simple characterizations of important structural properties like the number of connected components of the bisector of three sites. Furthermore, we prove that two related bisectors of three sites may intersect in permuted order.
Citations
|
347
|
Voronoi diagrams: A survey of a fundamental geometric data structure
– Aurenhammer
- 1991
|
|
224
|
The Quickhull algorithm for convex hulls
– Barber, Dobkin, et al.
- 1996
|
|
142
|
Closest-Point Problems
– Shamos, Hoey
- 1975
|
|
81
|
Voronoi diagrams
– Aurenhammer, Klein
- 2000
|
|
54
|
Voronoi diagrams based on convex distance functions
– Chew, Drysdale
- 1985
|
|
53
|
Algorithmic motion planning in robotics
– Sharir
- 1989
|
|
41
|
Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom
– Boissonnat, Sharir, et al.
- 1998
|
|
35
|
Randomized incremental construction of abstract Voronoi diagrams
– Klein, Mehlhorn, et al.
- 1993
|
|
18
|
Geomview: A system for geometric visualization
– Amenta, Levy, et al.
- 1995
|
|
17
|
On the construction of abstract Voronoi diagrams
– Mehlhorn, Meiser, et al.
- 1991
|
|
15
|
Concrete and Abstract Voronoi Diagrams. Volume 400
– Klein
- 1989
|
|
13
|
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
– Chew, Kedem, et al.
- 1998
|
|
11
|
Two dimensional Voronoi diagrams in the Lp-metric
– LEE
- 1980
|
|
7
|
Convex distance functions in 3-space are different
– Icking, Klein, et al.
- 1995
|
|
7
|
Geometry and Convexity: A Study in Mathematical Methods
– Kelly, Weiss
- 1978
|
|
7
|
The Complexity of Substructures in Arrangements of Surfaces
– Tagansky
- 1996
|
|
5
|
Distance problems in computational geometry with fixed orientations
– Widmayer, Wu, et al.
- 1985
|
|
4
|
Combinatorial properties of abstract Voronoi diagrams
– Klein
- 1989
|
|
3
|
On bisectors for different distance functions
– Icking, Klein, et al.
- 1999
|
|
3
|
On general properties of strictly convex smooth distance functions
– Lê
- 1993
|
|
2
|
On non-smooth convex distance functions
– Lê
- 1997
|
|
2
|
Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
– Lê
- 1997
|
|
1
|
On Voronoi diagrams in the Lp-metric in
– Lê
- 1996
|
