Efficient algorithms for computing the maximum distance between two finite planar sets (Q4747526): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(83)90040-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074815218 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:14, 19 March 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
