Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430)
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 6796748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem |
scientific article; zbMATH DE number 6796748 |
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
0.92878425
0 references
0.91041946
0 references
0 references
0.87926614
0 references
0.8738882
0 references
0.86671096
0 references
