A new metric between polygons, and how to compute it
From MaRDI portal
Publication:5204335
DOI10.1007/3-540-55719-9_92zbMath1427.68337OpenAlexW1553203695MaRDI QIDQ5204335
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_92
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for the Hausdorff distance between convex polygons
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- A linear-time algorithm for a special case of disjoint set union
- Min-max heaps and generalized priority queues
- Optimal matching of convex polygons
This page was built for publication: A new metric between polygons, and how to compute it
