Matching sets of line segments

DOI10.1016/j.tcs.2021.03.014zbMath1486.68223OpenAlexW3134882281MaRDI QIDQ2662685

Antoine Vigneron, Hyeyun Yang

Publication date: 14 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.03.014

zbMATH Keywords

approximation algorithmpattern matchinggeometric algorithmline-segments matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Approximating the maximum overlap of polygons under translation
• Geometric pattern matching under Euclidean motion
• Maximizing the overlap of two planar convex sets under rigid motions
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Approximate matching of polygonal shapes
• Finding Largest Common Point Sets
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Generalized Selection and Ranking: Sorted Matrices
• MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION
• Geometric optimization and sums of algebraic functions
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Matching sets of line segments