An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 19:32, 7 February 2024
scientific article; zbMATH DE number 2174843
Language | Label | Description | Also known as |
---|---|---|---|
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