Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31530" target="_blank" >RIV/00216305:26210/02:PU31530 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles
Original language description
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
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
ISBN
80-214-2135-5
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
353-356
Publisher name
VUT FSI
Place of publication
Brno
Event location
Brno
Event date
Jun 5, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—