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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.99847674369812
0 references
0.8239814639091492
0 references
0.7849457263946533
0 references
