Matching Sets of Line Segments

被引：0

作者：

Yang, Hyeyun ^{[1
]}

Vigneron, Antoine ^{[1
]}

机构：

[1] UNIST, Sch Elect & Comp Engn, Ulsan, South Korea

来源：

WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019) | 2019年 / 11355卷

基金：

新加坡国家研究基金会;

关键词：

Geometric algorithms; Approximation algorithms; Pattern matching; OVERLAP;

D O I：

10.1007/978-3-030-10564-8_21

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 point set. We study these similarity measures under several sets of transformations: translations, rotations about a fixed point and rigid motions. 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.

引用

页码：261 / 273

页数：13

共 50 条

[1] Matching sets of line segments
Yang, Hyeyun
Vigneron, Antoine
[J]. THEORETICAL COMPUTER SCIENCE, 2021, 866 : 82 - 95
[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
Brimkov, Boris
Geneson, Jesse
Jensen, Alathea
Broussard, Jordan
Nowbandegani, Pouria Salehi
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2302 - 2323
[9] 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
[10] 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

← 1 2 3 4 5 →