๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane

โœ Scribed by S. Kapoor; S. N. Maheshwari; J. S. B. Mitchell

Publisher
Springer
Year
1997
Tongue
English
Weight
126 KB
Volume
18
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype

An approximation algorithm for a bottlen
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
โœ Lusheng Wang; Zimao Li ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in