# Item

ITEM ACTIONSEXPORT

Released

Report

#### On characteristic points and approximate decision algorithms for the minimum Hausdorff distance

##### Locator

There are no locators available

##### Fulltext (public)

MPI-I-94-150.pdf

(Any fulltext), 168KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Chew, L. P., Kedem, K., & Schirra, S.(1994). *On characteristic
points and approximate decision algorithms for the minimum Hausdorff distance* (MPI-I-94-150). Saarbrücken: Max-Planck-Institut
für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B53B-7

##### Abstract

We investigate {\em approximate decision algorithms} for determining
whether the minimum Hausdorff distance between two points sets (or
between two sets of nonintersecting line segments) is at most
$\varepsilon$.\def\eg{(\varepsilon/\gamma)}
An approximate decision algorithm is a standard decision algorithm
that answers {\sc yes} or {\sc no} except when $\varepsilon$ is in
an {\em indecision interval}
where the algorithm is allowed to answer {\sc don't know}.
We present algorithms with indecision interval
$[\delta-\gamma,\delta+\gamma]$ where $\delta$ is the minimum
Hausdorff distance and $\gamma$ can be chosen by the user.
In other words, we can make our
algorithm as accurate as desired by choosing an appropriate $\gamma$.
For two sets of points (or two sets of nonintersecting lines) with
respective
cardinalities $m$ and $n$ our approximate decision algorithms run in
time $O(\eg^2(m+n)\log(mn))$ for Hausdorff distance under translation,
and in time $O(\eg^2mn\log(mn))$ for Hausdorff distance under
Euclidean motion.