Detail publikace

Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles

ŠEDA, M.

Originální název

Computing the Euclidean Shortest Path in the Plane with Polygonal Obstacles

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

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

Klíčová slova v angličtině

computational geometry, motion planning, visibility graph

Autoři

ŠEDA, M.

Rok RIV

2002

Vydáno

1. 6. 2002

Nakladatel

VUT FSI

Místo

Brno

ISBN

80-214-2135-5

Kniha

Proceedings of the 8th International Conference on Soft Computing MENDEL 2002

Strany od

353

Strany do

356

Strany počet

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"
}