Small candidate set for translational pattern search

DOI10.1007/s00453-022-00997-xOpenAlexW4283822394MaRDI QIDQ2088592

Jianxin Wang, Qilong Feng, Jinhui Xu, Ziyun Huang

Publication date: 6 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00997-x

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
• Improved approximation algorithms for geometric set cover
• \(\epsilon\)-nets and simplex range queries
• The upper envelope of Voronoi surfaces and its applications
• Combinatorial and experimental methods for approximate point pattern matching
• FPTAS for Minimizing Earth Mover’s Distance under Rigid Transformations
• Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
• On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
• Space-time tradeoffs for approximate nearest neighbor searching
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• On Clustering Induced Voronoi Diagrams
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

This page was built for publication: Small candidate set for translational pattern search