File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Matching sets of line segments
- Author(s)
- Yang, Hyeyun, Vigneron, Antoine
- Issued Date
- 2021-04
- Citation
- THEORETICAL COMPUTER SCIENCE, v.866, pp.82 - 95
- Abstract
- 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.
- Publisher
- ELSEVIER
- ISSN
- 0304-3975
- Keyword (Author)
- Geometric algorithms, Approximation algorithms, Pattern matching
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.