An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:08, 8 February 2024
scientific article; zbMATH DE number 7571919
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) algorithm for computing a link center in a simple polygon |
scientific article; zbMATH DE number 7571919 |
Statements
An O(n log n) algorithm for computing a link center in a simple polygon (English)
0 references
16 August 2022
0 references
geodesic distance
0 references
boundary segment
0 references
simple polygon
0 references
link distance
0 references
link center
0 references
