Computing Geodesic Furthest Neighbors in Simple Polygons
نویسنده
چکیده
An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corollary, the geodesic diameter of the polygon also can be computed within the same time and space bounds.
منابع مشابه
Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons
Given two simple polygons P and Q we define the weight of a bridge (p, q), with p ∈ ρ(P ) and q ∈ ρ(Q), where ρ() denotes the compact region enclosed by the boundary of the polygon, between the two polygons as gd(p, P ) + d(p, q) + gd(q, Q), where d(p, q) is the Euclidean distance between the points p and q, and gd(x, X) is the geodesic distance between x and its geodesic furthest neighbor on X...
متن کاملL_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems
In this paper, we investigate the L1 geodesic farthest neighbors in a simple polygon P , and address several fundamental problems related to farthest neighbors. Given a subset S ⊆ P , an L1 geodesic farthest neighbor of p ∈ P from S is one that maximizes the length of L1 shortest path from p in P . Our list of problems include: computing the diameter, radius, center, farthestneighbor Voronoi di...
متن کاملFinding Optimal Geodesic Bridges Between Two Simple Polygons
Given two simple polygons P and Q we study the problem of finding an optimal geodesic bridge. Our problem differs from other versions of the problem where the bridge is a Euclidean bridge. An Euclidean bridge corresponds to a straight line flyover-like bridge, where as a geodesic bridge corresponds to finding a route for a ferry boat. The objective in both of these problems is to find a bridge ...
متن کاملComputing the Constrained Euclidean, Geodesic and Link Centre of a Simple Polygon with Applications
In the manufacturing industry, nding a suitable location for the pin gate (the pin gate is the point from which liquid is poured or injected into a mold) is a diicult problem when viewed from the uid dynamics of the molding process. However, experience has shown that a suitable pin gate location possesses several geometric characteristics, namely the distance from the pin gate to any point in t...
متن کامل5. Acknowledgments 4. the Algorithm 3. Geodesic Circuits and Separability of Polygons 2. Geodesic Paths and Relative Convex Hulls on Separating Two Simple Polygons by a Single Translation*
Let P and Q be two disjoint simple polygons having n sides each. We present an al-gorithm which determines whether Q can be moved by a single translation to a posi-tion sufficiently far from P, and which produces all such motions if they exist. The al-gorithm runs in time O(t(n)) where t(n) is the time needed to triangulate an n-sidedpolygon. Since Tarjan and Van Wyk have re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 39 شماره
صفحات -
تاریخ انتشار 1989