𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computing the shortest path in a multiply-connected domain having curved boundaries

✍ Scribed by Wei, Xiangzhi; Joneja, Ajay

Book ID
122196721
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
372 KB
Volume
48
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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