Dynamic data structures for approximate Hausdorff distance in the word RAM

DOI10.1016/J.COMGEO.2016.08.002MaRDI QIDQ680153zbMATHOpenAlexFDO

Authors 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

Hausdorff distancecomputational geometryapproximation algorithmsdynamic data structures

Mathematics Subject Classification ID

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

Recommendations

• Publication:4661876
• Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
• Fast, precise and dynamic distance queries
• Publication:4449249
• Maintaining the minimal distance of a point set in polylogarithmic time

Cites work

• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• scientific article; zbMATH DE number 2119699 (Why is no real title available?)
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Semi-Online Maintenance of Geometric Optima and Measures

Cited in

(4)

• On locality-sensitive orderings and their applications
• On approximate geodesic-distance queries amid deforming point clouds
• On Locality-Sensitive Orderings and Their Applications
• Dynamic programming on the word RAM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680153)