Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem |
scientific article |
Statements
Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (English)
0 references
23 October 2017
0 references
computational geometry
0 references
planar 2-center problem
0 references
smallest enclosing circle problem
0 references
convex polygons
0 references
