Efficient algorithms for computing the maximum distance between two finite planar sets (Q4747526): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:16, 7 February 2024
scientific article; zbMATH DE number 3804871
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for computing the maximum distance between two finite planar sets |
scientific article; zbMATH DE number 3804871 |
Statements
Efficient algorithms for computing the maximum distance between two finite planar sets (English)
0 references
1983
0 references
maximum euclidean distance
0 references
finite planar sets
0 references