Fast algorithms for computing the diameter of a finite planar set (Q1104078)
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: Fast algorithms for computing the diameter of a finite planar set |
scientific article; zbMATH DE number 4055036
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for computing the diameter of a finite planar set |
scientific article; zbMATH DE number 4055036 |
Statements
Fast algorithms for computing the diameter of a finite planar set (English)
0 references
1988
0 references
Monte Carlo simulation
0 references
diameter
0 references
finite planar set
0 references
worst-case running time
0 references
expected-complexity
0 references
approximate algorithm
0 references
