A linear-time algorithm for the geodesic center of a simple polygon
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic
distance between them is the length of the shortest path that connects them among all paths …
distance between them is the length of the shortest path that connects them among all paths …
[HTML][HTML] Computing the L1 geodesic diameter and center of a simple polygon in linear time
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 …
computed in linear time. For the purpose, we focus on revealing basic geometric properties …
Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle
We present efficient algorithms for shortest-path and minimum-link-path queries between
two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided …
two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided …
On the geodesic centers of polygonal domains
H Wang - Journal of Computational Geometry, 2018 - jocg.org
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal
domain $ P $ with a total of $ n $ vertices. We discover many interesting observations. We …
domain $ P $ with a total of $ n $ vertices. We discover many interesting observations. We …
An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon
S Schuierer - International Journal of Computational Geometry & …, 1996 - World Scientific
We present a data structure that allows to preprocess a rectilinear polygon with n vertices
such that, for any two query points, the shortest path in the rectilinear link or L1-metric can be …
such that, for any two query points, the shortest path in the rectilinear link or L1-metric can be …
A linear-time algorithm for the geodesic center of a simple polygon
Given two points in a simple polygon $ P $ of $ n $ vertices, its geodesic distance is the
length of the shortest path that connects them among all paths that stay within $ P $. The …
length of the shortest path that connects them among all paths that stay within $ P $. The …
[BOOK][B] Dynamic and I/O-efficient algorithms for computational geometry and graph problems: theoretical and experimental results
YJ Chiang - 1996 - search.proquest.com
As most important applications today are large-scale in nature, high-performance methods
are becoming indispensable. Two promising computational paradigms for large-scale …
are becoming indispensable. Two promising computational paradigms for large-scale …
On the geodesic centers of polygonal domains
H Wang - arxiv preprint arxiv:1607.05824, 2016 - arxiv.org
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal
domain $\mathcal {P} $ with a total of $ n $ vertices. We discover many interesting …
domain $\mathcal {P} $ with a total of $ n $ vertices. We discover many interesting …
An optimal algorithm for the rectilinear link center of a rectilinear polygon
BJ Nilsson, S Schuierer - Computational Geometry, 1996 - Elsevier
The link distance between two points in a polygon P is defined as the minimum number of
line segments inside P needed to connect the two points. The link center of a polygon P is …
line segments inside P needed to connect the two points. The link center of a polygon P is …
Optimal parallel algorithms for rectilinear link-distance problems
We provide optimal parallel solutions to several link-distance problems set in trapezoided
rectilinear polygons. All our main parallel algorithms are deterministic and designed to run …
rectilinear polygons. All our main parallel algorithms are deterministic and designed to run …