| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6868430 | Computational Geometry | 2018 | 26 Pages |
Abstract
We present algorithms for an EGSM problem for point sets under translations where the neighborhood graph is a tree. We measure the similarity of the shapes by the L1-Hausdorff distance (and the Hausdorff distance induced by other polygonal metrics).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christian Knauer, Luise Sommer, Fabian Stehn,