Voronoi Diagrams and their Applications in Motion Planning

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31527" target="_blank" >RIV/00216305:26210/02:PU31527 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Voronoi Diagrams and their Applications in Motion Planning
Popis výsledku v původním jazyce
A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to the othersite. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate their possible use in point-to-point motion planning and propose a method for solving this probllem on a rectilinear plane.
Název v anglickém jazyce
Voronoi Diagrams and their Applications in Motion Planning
Popis výsledku anglicky
A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to the othersite. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate their possible use in point-to-point motion planning and propose a method for solving this probllem on a rectilinear plane.

Rok uplatnění
2002
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)