𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Querying two boundary points for shortest paths in a polygonal domain

✍ Scribed by Sang Won Bae; Yoshio Okamoto

Book ID
113550925
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
296 KB
Volume
45
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ Arthur W. Chou; Ker-I Ko πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do

The shortest path in a simply-connected
The shortest path in a simply-connected domain having a curved boundary
✍ S. Bharath Ram; M. Ramanathan πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 725 KB

Given two distinct points S and E on a closed parametric curve forming the boundary of a simplyconnected domain (without holes), this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. The SIP consists of portions of curves along with straight