An optimal algorithm for one-separation of a set of isothetic polygons (Q707337): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ins.2003.06.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.INS.2003.06.007 / rank | |||
Normal rank | |||
Revision as of 07:32, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for one-separation of a set of isothetic polygons |
scientific article |
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
