Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.20382/jocg.v5i1a12 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.20382/JOCG.V5I1A12 / rank | |||
Normal rank | |||
Latest revision as of 06:57, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of the Hausdorff distance in unbounded dimension |
scientific article |
Statements
9 March 2017
0 references
computational complexity
0 references
Hausdorff distance
0 references
Helly-type theorem
0 references
polynomial time algorithms
0 references
Computational aspects of the Hausdorff distance in unbounded dimension (English)
0 references
