Přístupnostní navigace
E-application
Search Search Close
Publication detail
ŠEDA, M.
Original Title
Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles
Type
conference paper
Language
English
Original Abstract
In this paper, the problem of finding the shortest path in the Euclidean plane with polygonal obstacles is considered. It has many industrial applications where point-to-point motion is needed. An approach to its solution based on a visibility graph is presented
Key words in English
computational geometry, motion planning, visibility graph
Authors
RIV year
2002
Released
1. 6. 2002
Publisher
VUT FSI
Location
Brno
ISBN
80-214-2135-5
Book
Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
Pages from
353
Pages to
356
Pages count
4
BibTex
@inproceedings{BUT10547, author="Miloš {Šeda}", title="Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles", booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002", year="2002", pages="4", publisher="VUT FSI", address="Brno", isbn="80-214-2135-5" }