An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194)
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 2174843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT |
scientific article; zbMATH DE number 2174843 |
Statements
An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (English)
0 references
10 June 2005
0 references
Algorithm design and analysis
0 references
computational geometry
0 references
link distance
0 references
simple polygon
0 references
shortest segment
0 references
0 references
0 references
0.8816962242126465
0 references
0.8743789792060852
0 references
0.8546938300132751
0 references
0.8301528692245483
0 references
