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 条

[21] Place recognition based on matching of planar surfaces and line segments
Cupec, Robert
Nyarko, Emmanuel Karlo
Filko, Damir
Kitanov, Andrej
Petrovic, Ivan
[J]. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2015, 34 (4-5): : 674 - 704
[22] Line Segments Stereo Matching Algorithm Based on Topological Relationship
Wei, Zhenzhong
Xi, Man
Hou, Yarong
Zhang, Guangjun
[J]. PROCEEDINGS OF FIRST INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION, VOL V: MODELLING AND SIMULATION IN MECHANICS AND MANUFACTURE, 2008, : 204 - 208
[23] Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
Brimkov, Valentin E.
Leach, Andrew
Mastroianni, Michael
Wu, Jimmy
[J]. ADVANCES IN VISUAL COMPUTING, PT I, 2010, 6453 : 592 - +
[24] Algorithms for matching 3D line sets
Kamgar-Parsi, B
Kamgar-Parsi, B
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (05) : 582 - 593
[25] Connected equi-length line segments for curve and structure matching
Zhao, Y
Chen, YQ
[J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (06) : 1019 - 1037
[26] Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
Joshi, Anup
Narayanaswamy, N. S.
[J]. ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 357 - 367
[27] Matching of straight line segments from aerial stereo images of urban areas
Ok, Ali Ozgun
Wegner, Jan Dirk
Heipke, Christian
Rottensteiner, Franz
Soergel, Uwe
Toprak, Vedat
[J]. ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2012, 74 : 133 - 152
[28] Reporting Red—Blue Intersections between Two Sets of Connected Line Segments
[J]. Algorithmica, 2003, 35 : 1 - 20
[29] On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
Marc Glisse
Sylvain Lazard
[J]. Discrete & Computational Geometry, 2012, 47 : 756 - 772
[30] On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
Glisse, Marc
Lazard, Sylvain
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 47 (04) : 756 - 772

← 1 2 3 4 5 →