Finding Largest Common Point Sets

DOI10.1142/S0218195917500029zbMath1423.68560OpenAlexW2743812276MaRDI QIDQ3132918

Juyoung Yon, Antoine Vigneron, Siu-Wing Cheng, Otfried Schwarzkopf

Publication date: 31 January 2018

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195917500029

zbMATH Keywords

translationscongruencepartial matchingbottleneck distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Matching sets of line segments

Cites Work

• Unnamed Item
• Unnamed Item
• Bottleneck non-crossing matching in the plane
• Approximate one-to-one point pattern matching
• Noisy colored point set matching
• Bottleneck partial-matching Voronoi diagrams and applications
• Approximate decision algorithms for point set congruence
• An application of point pattern matching in astronautics
• Congruence, similarity, and symmetries of geometric objects
• Approximate congruence in nearly linear time
• Combinatorial and experimental methods for approximate point pattern matching
• Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Finding Largest Common Point Sets