An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218195900000103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120092636 / rank | |||
Normal rank | |||
Latest revision as of 11:09, 30 July 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
0 references
0 references
