COMPUTING THE HAUSDORFF SET DISTANCE IN LINEAR TIME FOR ANY LP POINT DISTANCE

被引：22
|
作者：
SHONKWILER, R
机构：
[1] School of Mathematics, Georgia Institute of Technology, Atlanta
来源：
INFORMATION PROCESSING LETTERS | 1991年 / 38卷 / 04期
关键词：
COMPUTATIONAL GEOMETRY; HAUSDORFF DISTANCE; METRIC FIELD; IMAGE PROCESSING;
D O I：
10.1016/0020-0190(91)90101-M
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A linear time minimal memory algorithm is given for constructing the "metric field" for cellularized point sets in arbitrary dimension. Resultant such metric fields are used to obtain Hausdorff set distances between sets of points. These techniques have applications to image processing.
引用
收藏
页码：201 / 207
页数：7
相关论文
共 50 条
  • [21] A linear transportation LP distance for pattern recognition
    Crook, Oliver M.
    Cucuringu, Mihai
    Hurst, Tim
    Schonlieb, Carola-Bibiane
    Thorpe, Matthew
    Zygalakis, Konstantinos C.
    PATTERN RECOGNITION, 2024, 147
  • [22] COMPUTING THE HAUSDORFF DISTANCE BETWEEN TWO SETS OF PARAMETRIC CURVES
    Kim, Ik-Sung
    McLean, William
    COMMUNICATIONS OF THE KOREAN MATHEMATICAL SOCIETY, 2013, 28 (04): : 833 - 850
  • [23] On computing the minimum distance of linear codes
    Mohri, M
    Morii, M
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2000, 83 (11): : 32 - 42
  • [24] On computing the minimum distance of linear codes
    Mohri, Masami
    Morii, Masakatu
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 2000, 83 (11): : 32 - 42
  • [25] A new algorithm for computing the minimum Hausdorff distance between two point sets on aline under translation
    Liu, Banghe
    Shen, Yuefeng
    Li, Bo
    INFORMATION PROCESSING LETTERS, 2008, 106 (02) : 52 - 58
  • [26] The vertex linear arboricity of an integer distance graph with a special distance set
    Zuo, LC
    Wu, JL
    Liu, JZ
    ARS COMBINATORIA, 2006, 79 : 65 - 76
  • [27] A Novel Simplification Method of Point Cloud with Directed Hausdorff Distance
    Li, Taifeng
    Pan, Quanke
    Gao, Liang
    Li, Peigen
    2017 IEEE 21ST INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2017, : 469 - 474
  • [28] Determining the Hausdorff Distance Between Trees in Polynomial Time
    Kelenc, Aleksander
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (03):
  • [29] Determining the hausdorff distance between trees in polynomial time
    Kelenc A.
    Discrete Mathematics and Theoretical Computer Science, 2021, 23 (01):
  • [30] A computation method of Hausdorff distance for translation time scales
    Wang Chao
    Agarwal, Ravi P.
    O'Regan, Donal
    Sakthivel, Rathinasamy
    APPLICABLE ANALYSIS, 2020, 99 (07) : 1218 - 1247
12345