𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for near cost optimal line plans

✍ Scribed by Michael R. Bussieck; Thomas Lindner; Marco E. Lübbecke

Publisher
Springer
Year
2004
Tongue
English
Weight
379 KB
Volume
59
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line algorithm for optimal 3D path pl
On-line algorithm for optimal 3D path planning
✍ Chien-Wan Hun; Hun-Chen Chen; Ming-Fung Hwang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 927 KB

The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is present

A cost optimal parallel algorithm for we
A cost optimal parallel algorithm for weighted distance transforms
✍ Akihiro Fujiwara; Michiko Inoue; Toshimitsu Masuzawa; Hideo Fujiwara 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The distance transform and the nearest feature transform are useful operations in image processing. These transforms are based on various kinds of distance functions because the distance functions have dierent eciency or usefulness. In this paper, we consider these transforms based on the weighted d