✦ LIBER ✦

Approximate motion planning and the complexity of the boundary of the union of simple geometric figures

✍ Scribed by Helmut Alt; Rudolf Fleischer; Michael Kaufmann; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig

Publisher: Springer
Year: 1992
Tongue: English
Weight: 823 KB
Volume: 8
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758853

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of planning and

Computational complexity of planning and approximate planning in the presence of incompleteness

✍ Chitta Baral; Vladik Kreinovich; Raúl Trejo 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 213 KB

In the last several years, there have been several studies about the computational complexity of classical planning assuming that the planner has complete knowledge about the initial situation. Recently, there have been proposals to use 'sensing' actions to plan in the presence of incompleteness. In

Geometric Eccentricity and the Complexit

Geometric Eccentricity and the Complexity of Manipulation Plans

✍ A. F. van der Stappen; K. Goldberg; M.H. Overmars 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 322 KB

A geometric correction in the problem on

A geometric correction in the problem on the motion of a free boundary

✍ G. A. Omel’yanov; V. V. Trushkov 📂 Article 📅 1996 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 177 KB

The densest coverage of a strip by figur

The densest coverage of a strip by figures of complex geometrical shape. II

✍ A. G. Glushko; V. L. Rvachev; Yu. G. Stoyan 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 280 KB

The densest coverage of a strip by figur

The densest coverage of a strip by figures of complex geometric shape. I

✍ A. G. Glushko; V. L. Rvachev; Yu. G. Stoyan 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 327 KB

A geometric inequality and the complexit

A geometric inequality and the complexity of computing volume

✍ G. Elekes 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 177 KB