加载中…
In this paper, we show that the 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 geodesic balls, that is, the metric balls with respect to the geodesic distance. More specifically, in this paper we show that any family of geodesic balls in any simple polygon has Helly number two, and the 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本