In a geometric context, a collision or proximity query reports information about the relative
configuration or placement of two objects. Some of the common examples of such queries …

Wie bestimmt man in einer Menge von Punkten am schnellsten zu jedem Punkt seinen
nächsten Nachbarn? Wie läßt sich der Durchschnitt von zwei Polygonen effizient …

Das Vergleichen zweier geometrischer Formen ist eine Aufgabe, die aus vielerlei
Anwendungen natürlich hervorgeht. Einige Anwendungen sind Computer Vision, Computer …

We investigate the computational complexity of computing the Hausdorff distance.
Specifically, we show that the decision problem of whether the Hausdorff distance of two …

This article is a survey on methods from computational geometry for comparing shapes that
we developed within our work group at Freie Universität Berlin. In particular, we will present …

In the process of producing information from images with very or ultra-high spatial resolution
(VHR and UHR), the most accurate results are achieved by using object-based image …

Hausdorff distance measure is very important in CAD/CAE/CAM related applications. This
manuscript presents an efficient framework and two complementary subalgorithms to directly …

We present a simple algorithm to compute the Hausdorff distance between complicated,
polygonal models at interactive rates. The algorithm requires no assumptions about the …

For automotive radar-based extended object tracking, this paper proposes a new approach,
which jointly estimates the kinematic state and the extension of a vehicle. The vehicle's …

This paper presents a geometric pruning method for computing the Hausdorff distance
between two B-spline curves. It presents a heuristic method for obtaining the one-sided …