1-Sided Segment Hausdorff Distance under Translation

Given two sets $A$ , $B$ , each containing $n$ segments in $\mathbb R^2$ , compute $d'_H(A, B)$ , or the minimum one-sided Hausdorff distance under translation between $A$ and $B$ .

Parameters

$n$ : number of segments in $A$ ; also the number of segments in $B$

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

			See more
Segments Containing Points	1-Sided Segment Hausdorff Distance under Translation	2001

Other relevant algorithms