scientific article; zbMATH DE number 7610223

DOI10.20382/JOCG.V13I2A3MaRDI QIDQ5044450zbMATH OpenFDO

Authors Karl Bringmann, André Nusser

Publication date 31 October 2022

Full work available at URL https://arxiv.org/abs/2101.07696

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Hausdorff distance under translation for points and balls
• Hausdorff distance under translation for points and balls
• Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
• Discrete Fréchet Distance under Translation
• Getting around a lower bound for the minimum Hausdorff distance
• On the complexity of computing the Hausdorff distance
• A computation method of Hausdorff distance for translation time scales
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms

Cited in

(3)

• Hausdorff distance under translation for points and balls
• Hausdorff distance under translation for points and balls
• The complexity of the Hausdorff distance

This page was built for publication:

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