Dynamic data structures for approximate Hausdorff distance in the word RAM

DOI10.1016/J.COMGEO.2016.08.002zbMATH Open1381.65020OpenAlexW2508006611MaRDI QIDQ680153FDOQ680153

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

Recommendations

• scientific article; zbMATH DE number 2149349
• Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
• Fast, precise and dynamic distance queries
• scientific article; zbMATH DE number 2038782
• Maintaining the minimal distance of a point set in polylogarithmic time

zbMATH Keywords

Hausdorff distancecomputational geometryapproximation algorithmsdynamic data structures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Semi-Online Maintenance of Geometric Optima and Measures
• Dynamic Euclidean minimum spanning trees and extrema of binary functions

Cited In (4)

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

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)