Dynamic data structures for approximate Hausdorff distance in the word RAM

DOI10.1016/j.comgeo.2016.08.002zbMath1381.65020OpenAlexW2508006611MaRDI QIDQ680153

Timothy M. Chan, Dimitrios Skrepetos

Publication date: 22 January 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.08.002

zbMATH Keywords

computational geometryapproximation algorithmsHausdorff distancedynamic data structures

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

On Locality-Sensitive Orderings and Their Applications ⋮ On Locality-Sensitive Orderings and Their Applications

Cites Work

• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Semi-Online Maintenance of Geometric Optima and Measures
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic data structures for approximate Hausdorff distance in the word RAM