Efficient algorithms for shortest distance queries on special classes of polygons (Q673766)
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: Efficient algorithms for shortest distance queries on special classes of polygons |
scientific article; zbMATH DE number 985752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for shortest distance queries on special classes of polygons |
scientific article; zbMATH DE number 985752 |
Statements
Efficient algorithms for shortest distance queries on special classes of polygons (English)
0 references
28 February 1997
0 references
rectilinear minimum bend path
0 references
