Distance Trisector Curves in Regular Convex Distance Me

  • Authors:
  • Tetsuo Asano;David Kirkpatrick

  • Affiliations:
  • JAIST, Japan;University of British Columbia

  • Venue:
  • ISVD '06 Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given two points A and B in the plane, we are interested in separating them by two curves CA and CB such that CA is equidistant from A and CB, and CB is equidistant from B and CA. Such curves generalize the familiar notion of a bisector curve, and form the basis of a new kind of Voronoi diagram called a Zone diagram. These curves, which are referred to as distance trisector curves, have been studied in the Euclidean metric where they exist, are unique, and admit efficient approximations. Nevertheless, they have no known expression in terms of elementary functions and are conjectured to be non-algebraic. In this paper, we study distance trisector curves with respect to a parameterized family of distance metrics that provide arbitrarily close approximations to the Euclidean distance. The advantage of studying distance trisectors in this setting is that they have a simple piecewise-linear description and an efficient (exact) construction. We show that distance trisectors defined in this way provide a conceptually simple alternative proof of the existence and uniqueness of Euclidean trisector curves.