Computing the Hausdorff distance between two sets of parametric curves
Commun. Korean Math. Soc. 2013 Vol. 28, No. 4, 833-850
Printed October 1, 2013
Ik-Sung Kim and William McLean
Korea Maritime University, The University of New South Wales
Abstract : We present an algorithm for computing the Hausdorff distance between two parametric curves in $\R^n$, or more generally between two sets of parametric curves in $\R^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs $O(\log M)$ operations, compared with $O(M)$ operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.
Keywords : Hausdorff distance, pruning technique
Downloads: Full-text PDF  

Copyright © Korean Mathematical Society.
(Rm.1109) The first building, 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail:   | Powered by INFOrang Co., Ltd