An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703)
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 65045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n\log n)\) algorithm for computing the link center of a simple polygon |
scientific article; zbMATH DE number 65045 |
Statements
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (English)
0 references
27 September 1992
0 references
algorithm
0 references
link center
0 references
simple \(n\)-vertex polygon
0 references
link radius
0 references
0 references
0.9687860608100892
0 references
0.9467169642448424
0 references
0.8936246633529663
0 references
0.8681927919387817
0 references
