Time-space trade-offs for triangulating a simple polygon (Q5369532)
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: Time-space trade-offs for triangulating a simple polygon |
scientific article; zbMATH DE number 6792406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space trade-offs for triangulating a simple polygon |
scientific article; zbMATH DE number 6792406 |
Statements
17 October 2017
0 references
simple polygon
0 references
triangulation
0 references
shortest path
0 references
time-space trade-off
0 references
Time-space trade-offs for triangulating a simple polygon (English)
0 references
0.9987930655479432
0 references
0.8674553036689758
0 references
0.8614355325698853
0 references
0.8383299708366394
0 references
0.8352596759796143
0 references
