Finding a shortest diagonal of a simple polygon in linear time (Q676568)
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: Finding a shortest diagonal of a simple polygon in linear time |
scientific article; zbMATH DE number 992682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a shortest diagonal of a simple polygon in linear time |
scientific article; zbMATH DE number 992682 |
Statements
Finding a shortest diagonal of a simple polygon in linear time (English)
0 references
6 May 1997
0 references
shortest diagonal
0 references
visibility constraint
0 references
0 references
0.8589350581169128
0 references
0.8301622271537781
0 references
0.7959901094436646
0 references
0.7787835597991943
0 references
0.772125244140625
0 references
