Matching sets of line segments

被引：1
|
作者：
Yang, Hyeyun [1 ]
Vigneron, Antoine [1 ]
机构：
[1] UNIST, Sch Elect & Comp Engn, Ulsan, South Korea
来源：
THEORETICAL COMPUTER SCIENCE | 2021年 / 866卷
基金：
新加坡国家研究基金会;
关键词：
Geometric algorithms; Approximation algorithms; Pattern matching;
D O I：
10.1016/j.tcs.2021.03.014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give approximation algorithms for matching two sets of line segments in constant dimension. We consider several versions of the problem: Hausdorff distance, bottleneck distance and largest common subset. We study these similarity measures under several sets of transformations: translations in arbitrary dimension, rotations about a fixed point and rigid motions in two dimensions. As opposed to previous theoretical work on this problem, we match segments individually, in other words we regard our two input sets as sets of segments rather than unions of segments. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：82 / 95
页数：14
相关论文
共 50 条
  • [1] Matching Sets of Line Segments
    Yang, Hyeyun
    Vigneron, Antoine
    [J]. WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 261 - 273
  • [2] Matching sets of 3D line segments with application to polygonal arc matching
    KamgarParsi, B
    KamgarParsi, B
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (10) : 1090 - 1099
  • [3] On the perfect matching of disjoint compact sets by noncrossing line segments in Rn
    Hosono, K
    Matsuda, K
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 118 (03) : 223 - 238
  • [4] Pattern matching for sets of segments
    Efrat, A
    Indyk, P
    Venkatasubramanian, S
    [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 295 - 304
  • [5] Pattern matching for sets of segments
    Efrat, A
    Indyk, P
    Venkatasubramanian, S
    [J]. ALGORITHMICA, 2004, 40 (03) : 147 - 160
  • [6] Pattern Matching for Sets of Segments
    Alon Efrat
    Piotr Indyk
    Suresh Venkatasubramanian
    [J]. Algorithmica , 2004, 40 : 147 - 160
  • [7] On matching sets of 3D segments
    Guerra, C
    Pascucci, V
    [J]. VISION GEOMETRY VIII, 1999, 3811 : 157 - 167
  • [8] Intersections and circuits in sets of line segments
    Boris Brimkov
    Jesse Geneson
    Alathea Jensen
    Jordan Broussard
    Pouria Salehi Nowbandegani
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 2302 - 2323
  • [9] Intersections and circuits in sets of line segments
    Brimkov, Boris
    Geneson, Jesse
    Jensen, Alathea
    Broussard, Jordan
    Nowbandegani, Pouria Salehi
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2302 - 2323
  • [10] Probabilistic Matching of Line Segments for Their Homography
    Woo, Jihwan
    Kim, Taemin
    Kweon, In So
    [J]. 19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 156 - 159
12345