On bisectors for convex distance functions in 3-space

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.

[1]  Tamara Munzner,et al.  Geomview: a system for geometric visualization , 1995, SCG '95.

[2]  Ngoc-Minh Lê.  On General Properties of Strictly Convex Smooth Distance Functions in RD , 1993, CCCG.

[3]  Mariette Yvinec,et al.  Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions , 1995, SCG '95.

[4]  Rolf Klein,et al.  Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.

[5]  Ngoc-Minh Lê,et al.  On voronoi diagrams in theLp-metric in ℝD , 1996, Discret. Comput. Geom..

[6]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[7]  P. Kelly,et al.  Geometry and Convexity: A Study in Mathematical Methods , 1979 .

[8]  D. T. Lee,et al.  Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[9]  Robert L. Scot Drysdale,et al.  Voronoi diagrams based on convex distance functions , 1985, SCG '85.

[10]  Kurt Mehlhorn,et al.  On the construction of abstract voronoi diagrams , 1990, STACS.

[11]  Chak-Kuen Wong,et al.  Distance problems in computational geometry with fixed orientations , 1985, SCG '85.

[12]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[13]  Micha Sharir,et al.  Voronoi diagrams of lines in 3-space under polyhedral convex distance functions , 1995, SODA '95.

[14]  Ngoc-Minh Lê,et al.  Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space , 1997, Comput. Geom..

[15]  Rolf Klein,et al.  On bisectors for different distance functions , 2001, Discret. Appl. Math..

[16]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[17]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[18]  Kurt Mehlhorn,et al.  Randomized Incremental Construction of Abstract Voronoi Diagrams , 1993, Comput. Geom..

[19]  Rolf Klein,et al.  Convex distance functions in 3-space are different , 1993, SCG '93.

[20]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[21]  Rolf Klein,et al.  Combinatorial Properties of Abstract Voronoi Diagrams , 1990, WG.

[22]  P. Strevens.  Iii , 1985 .

[23]  Ngoc-Minh Lê.  On Non-Smooth Convex Distance Functions , 1997, Inf. Process. Lett..

[24]  Rolf Klein,et al.  On bisectors for different distance functions , 1999, SCG '99.

[25]  李幼升,et al.  Ph , 1989 .