An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal O(n n) algorithm for finding an enclosing planar rectilinear annulus of minimum width |
scientific article; zbMATH DE number 5595306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width |
scientific article; zbMATH DE number 5595306 |
Statements
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (English)
0 references
14 August 2009
0 references
facility location
0 references
minimum width annulus
0 references
rectilinear annulus
0 references
planar location
0 references
optimal algorithm
0 references
0 references
0.9117710590362548
0 references
0.9092161655426024
0 references
0.8516513109207153
0 references
0.8455418944358826
0 references
0.8432377576828003
0 references
