Abstract. In this paper, we show that the L1 geodesic diameter and center of a simple polygon can be computed in linear time. For the pur-pose, we focus on revealing basic geometric properties of the L1 geodesic balls, that is, the metric balls with respect to the L1 geodesic distance. More specifically, in this paper we show that any family of L1 geodesic balls in any simple polygon has Helly number two, and the L1 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.
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $P...
Polygons are a paramount data structure in computational geometry. While the complexity of many algo...
AbstractAn algorithm is presented for computing geodesic furthest neighbors for all the vertices of ...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
For a polygonal domain with h holes and a total of n vertices, we present algorithms that compute th...
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simp...
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simp...
We present an algorithm that exactly computes the geodesic center of a given polygonal domain. The r...
Given a simple polygon P with n vertices and a set Q of m points in P. we consider the geodesic k-ce...
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain P ...
In the geodesic 2-center problem in a simple polygon with n vertices, we find a set S of two points ...
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $P...
Polygons are a paramount data structure in computational geometry. While the complexity of many algo...
AbstractAn algorithm is presented for computing geodesic furthest neighbors for all the vertices of ...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance bet...
For a polygonal domain with h holes and a total of n vertices, we present algorithms that compute th...
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simp...
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simp...
We present an algorithm that exactly computes the geodesic center of a given polygonal domain. The r...
Given a simple polygon P with n vertices and a set Q of m points in P. we consider the geodesic k-ce...
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain P ...
In the geodesic 2-center problem in a simple polygon with n vertices, we find a set S of two points ...
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $P...
Polygons are a paramount data structure in computational geometry. While the complexity of many algo...
AbstractAn algorithm is presented for computing geodesic furthest neighbors for all the vertices of ...