COMPUTING THE MINIMUM HAUSDORFF DISTANCE BETWEEN 2 POINT SETS ON A LINE UNDER TRANSLATION

被引：158
|
作者：
ROTE, G
机构：
[1] Institut für Mathematik, Technische Universität Graz, A-8010 Graz
来源：
INFORMATION PROCESSING LETTERS | 1991年 / 38卷 / 03期
关键词：
COMPUTATIONAL GEOMETRY; HAUSDORFF DISTANCE; PATTERN RECOGNITION; PATTERN MATCHING;
D O I：
10.1016/0020-0190(91)90233-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given two sets of points on a line, we want to translate one of them so that their Hausdorff distance (the maximum of the distances from a point in any of the sets to the nearest point in the other set) is as small as possible. We present an optimal O(n log n) algorithm for this problem.
引用
收藏
页码：123 / 127
页数：5
相关论文
共 50 条
  • [31] MINIMUM HAUSDORFF DISTANCE UNDER RIGID MOTIONS AND COMPARISON OF PROTEIN STRUCTURES
    Banghe LI Bo LI Yuefeng SHEN Key Laboratory of Mathematics Mechanization and Center of Bioinformatics
    Graduate University of Chinese Academy of Sciences
    [J]. Journal of Systems Science & Complexity, 2009, 22 (04) : 560 - 586
  • [32] Minimum Hausdorff distance under rigid motions and comparison of protein structures
    Banghe Li
    Bo Li
    Yuefeng Shen
    [J]. Journal of Systems Science and Complexity, 2009, 22 : 560 - 586
  • [33] Minimum Hausdorff distance under rigid motions and comparison of protein structures
    Li, Banghe
    Li, Bo
    Shen, Yuefeng
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2009, 22 (04) : 560 - 586
  • [34] TRANSLATING HAUSDORFF IS HARD: FINE-GRAINED LOWER BOUNDS FOR HAUSDORFF DISTANCE UNDER TRANSLATION
    Bringmann, Karl
    Nusser, Andre
    [J]. JOURNAL OF COMPUTATIONAL GEOMETRY, 2022, 13 (02) : 30 - 50
  • [35] ON POINT SETS WITH DIFFERENCES OF DISTANCES NOT LESS THAN THE MINIMUM DISTANCE
    BARON, G
    [J]. LECTURE NOTES IN MATHEMATICS, 1990, 1452 : 1 - 5
  • [36] Computing constrained minimum-width annuli of point sets
    de Berg, M
    Bose, P
    Bremner, D
    Ramaswami, S
    Wilfong, G
    [J]. ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 392 - 401
  • [37] Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
    Knauer, Christian
    Scherfenberg, Marc
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 532 - 543
  • [38] Computing constrained minimum-width annuli of point sets
    de Berg, M
    Bose, P
    Bremner, D
    Ramaswami, S
    Wilfong, G
    [J]. COMPUTER-AIDED DESIGN, 1998, 30 (04) : 267 - 275
  • [39] APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION IN VARIANT HAUSDORFF DISTANCE
    Knauer, Christian
    Scherfenberg, Marc
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (03) : 369 - 381
  • [40] A Minimax Model for Generalized Penetration Distance Between Convex Sets by Directed Hausdorff Distance
    Wen, Yanfei
    Zhang, Wenxing
    [J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2022, 7 (03): : 6123 - 6130
12345