On bisectors for convex distance functions

DSpace/Manakin Repository

español português english

On bisectors for convex distance functions

Show full item record

Title: On bisectors for convex distance functions
Author: He, Chan; Martini, Horst; Wu, Senlin
Abstract: It is well known that the construction of Voronoi diagrams is based on the notion of bisector of two given points. Already in normed linear spaces, bisectors have a complicated structure and can, for many classes of norms, only be described with the help of topological methods. Even more general, we present results on bisectors for convex distance functions (gauges). Let C, with the origin o from its interior, be the compact, convex set inducing a convex distance function (gauge) in the plane, and let B( ̶ x, x) be the bisector of ̶ x and x, i.e., the set of points z whose distance (measured with the convex distance function induced by C) to ̶ x equals that to x. For example, we prove the following characterization of the Euclidean norm within the family of all convex distance functions: if the set L of points x in the boundary ∂C of C that create B( ̶ x, x) as a straight line has non-empty interior with respect to ∂C, then C is an ellipse centered at the origin. For the subcase of normed planes we give an easier approach, extending the result also to higher dimensions.
URI: http://hdl.handle.net/10662/10317
Date: 2013


Files in this item

Files Size Format View
2605-5686_28_1_57.pdf 423.9Kb PDF View  Thumbnail

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Attribution-NonCommercial-NoDerivatives 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International

Search DSpace


Browse

My Account

Statistics

Help

Redes sociales