Local differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions

نویسنده

  • Colm Ó Dúnlaing
چکیده

This paper studies local properties of Voronoi diagrams of sets of disjoint compact convex sites in R. It is established that bisectors are C surfaces and trisectors are C curves, and that as a point moves along a trisector its clearance sphere develops monotonically (Lemma 2.4). This monotonicity property is useful in establishing the existence of Voronoi vertices bounding edges in certain situations.1 The paper then considers the diagram for a set of disjoint spheres. Considerations about general position are covered in detail. By letting the spheres grow from point sites till they reach their true radius, it is shown that the Voronoi cell for the smallest site has complexity O(n), assuming that the sites are of at most k distinct radii. It follows that the Voronoi diagram is O(n). Although this is weaker than Aurenhammer’s result [1] establishing O(n) complexity with no restriction on radius, the techniques may be of value for studying more general Voronoi diagrams. Finally, the paper shows that without the bound on the number of different radii, the cell owned by a point site can have complexity Ω(n). 1 Voronoi diagrams: differentiability properties This paper considers the Voronoi diagrams of spherical sites in R. For a general survey of Voronoi diagrams see [2]. The current state of knowledge about the complexity of Voronoi diagrams, in 3 dimensions, is scanty. e-mail: [email protected]. Mathematics department website: http://www.maths.tcd.ie. Some of this work was presented at the eighteenth European Conference on Computational Geometry, Bonn, Germany, April 2003. 1 Chee Yap [8] seems to have been first to exploit such monotonicity properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Voronoi diagram construction with convex sites in three dimensions

Lee and Drysdale [13] and Sharir [16] have given suboptimal algorithms for computing the Voronoi diagrams of line-segments or discs in the plane. This paper adapts their methods to constructing the Voronoi diagram for disjoint convex sites in three dimensions. Let be an upper bound on the number of features in any diagram involving sites in three dimensions. Even for point sites, is , so it is ...

متن کامل

Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams

Generalized Voronoi diagrams of objects are di cult to compute in a robust way, especially in higher dimensions. For a number of applications an approximation of the real diagram within some predetermined precision is su cient. In this paper we study the computation of such approximate Voronoi diagrams. The emphasis is on practical applicability, therefore we are mainly concerned with fast (in ...

متن کامل

Zone diagrams in compact subsets of uniformly convex normed spaces

A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in advance. It has been studied by several authors, starting with T. Asano, J. Matoušek and T. Tokuyama, who considered the Euclidean plane with singleton sites, and...

متن کامل

Existence of zone diagrams in compact subsets of uniformly convex spaces

A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in advance. It has been studied by several authors, starting with T. Asano, J. Matoušek and T. Tokuyama, who considered the Euclidean plane with singleton sites, and...

متن کامل

Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function

The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003