Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6693749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of the Hausdorff distance in unbounded dimension |
scientific article; zbMATH DE number 6693749 |
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
0.8008630275726318
0 references
0.7983190417289734
0 references
0.7853009104728699
0 references
0.7847726941108704
0 references
