An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (Q4575663)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles |
scientific article; zbMATH DE number 6903959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles |
scientific article; zbMATH DE number 6903959 |
Statements
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (English)
0 references
16 July 2018
0 references
