pith. sign in

arxiv: 1312.3711 · v2 · pith:3FJSAUKYnew · submitted 2013-12-13 · 💻 cs.CG

Computing the L₁ Geodesic Diameter and Center of a Simple Polygon in Linear Time

classification 💻 cs.CG
keywords geodesicballscenterpolygonsimplediameterlinearproperties
0
0 comments X
read the original abstract

In this paper, we show that the $L_1$ geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the $L_1$ geodesic balls, that is, the metric balls with respect to the $L_1$ geodesic distance. More specifically, in this paper we show that any family of $L_1$ geodesic balls in any simple polygon has Helly number two, and the $L_1$ geodesic center consists of midpoints of shortest paths between diametral pairs. These properties are crucial for our linear-time algorithms, and do not hold for the Euclidean case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.