An optimal algorithm for one-separation of a set of isothetic polygons (Q707337)
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 optimal algorithm for one-separation of a set of isothetic polygons |
scientific article; zbMATH DE number 2132897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for one-separation of a set of isothetic polygons |
scientific article; zbMATH DE number 2132897 |
Statements
An optimal algorithm for one-separation of a set of isothetic polygons (English)
0 references
9 February 2005
0 references
Isothetic polygons
0 references
One-separation
0 references
Motion planning
0 references
Computational geometry
0 references
Optimal algorithm
0 references
0.8237575888633728
0 references
0.8132472634315491
0 references
0.8029521703720093
0 references
