Computing the shortest diagonal of a monotone polygon in linear time (Q1198084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the shortest diagonal of a monotone polygon in linear time |
scientific article; zbMATH DE number 92135 |
Statements
Computing the shortest diagonal of a monotone polygon in linear time (English)
0 references
16 January 1993
0 references
We improve the results of \textit{B. Zhu} and \textit{A. Mirzaian} [A linear time algorithm to find the shortest diagonal of a unimonotone polygon, Tech. Rept. CS-90-8, Dept. of Computer Science, York University (1990)] to present a linear time algorithm for an arbitrary monotone polygon.
0 references
shortest diagonal
0 references
monotone polygon
0 references
0.8589350581169128
0 references
0.8123924136161804
0 references
0.7989559173583984
0 references
0.7824295163154602
0 references
0.7682141065597534
0 references
