Abstract
The largest common point set problem (LCP) is, given two point set P and Q in d-dimensional Euclidean space, to find a subset of P with the maximum cardinality that is congruent to some subset of Q. We consider a special case of LCP in which the size of the largest common point set is at least (|P|+|Q|āk)/2. We develop efficient algorithms for this special case of LCP and a related problem. In particular, we present an O(k 3 n 1.34 + kn 2 log n) time algorithm for LCP in two dimensions, which is much better for small k than an existing O(n 3.2 log n) time algorithm, where nā=ā max {|P|,|Q|}.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akutsu, T.: Approximate String Matching with Donāt Care Characters. Information Processing LettersĀ 55, 235ā239 (1995)
Akutsu, T.: On Determining the Congruence of Point Sets in d Dimensions. Computational Geometry, Theory and ApplicationsĀ 9, 247ā256 (1998)
Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discrete and Computational GeometryĀ 20, 307ā331 (1998)
Alt, H., Melhorn, K., Wagener, H., Welzl, E.: Congruence, Similarity, and Symmetrics of Geometric Objects. Discrete and Computational GeometryĀ 3, 237ā256 (1988)
Amir, A., Farach, M.: Efficient 2-Dimensional Approximate Matching of Half- Rectangular Figures. Information and ComputationĀ 118, 1ā11 (1995)
Atkinson, M.D.: An Optimal Algorithm for Geometrical Congruence. J. AlgorithmsĀ 8, 159ā172 (1987)
Cardoze, D.E., Schulman, L.J.: Pattern Matching for Spatial Point Sets. In: Proc. 38th Symp. Foundations of Computer Science, pp. 156ā165 (1998)
Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., Welzl, E.: Combinatorial Complexity Bounds for Arrangements of Curves and Spheres. Discrete and Computational GeometryĀ 5, 99ā160 (1990)
Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)
Highnam, P.T.: Optimal Algorithms for Finding the Symmetries of a Planar Point Set. Information Processing LettersĀ 18, 219ā222 (1986)
Indyk, P., Venketasubramanian, S.: Approximate Congruence in Nearly Linear Time. Computational Geometry, Theory and ApplicationsĀ 24, 115ā128 (2003)
Landau, G.M., Vishkin, U.: Fast Parallel and Serial Approximate String Matching. J. AlgorithmsĀ 10, 157ā169 (1989)
Manacher, G.: An Application of Pattern Matching to a Problem in Geometrical Complexity. Information Processing LettersĀ 5, 6ā7 (1976)
McCright, E.M.: A Space-Economical Suffix Tree Construction Algorithm. J. ACMĀ 23, 262ā272 (1976)
Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. ComputingĀ 17, 1253ā1262 (1988)
SzĆ©kely, L.: Crossing Numbers and Hard Erdƶs Problems in Discrete Geometry. Combinatorics, Probability and ComputingĀ 6, 353ā358 (1997)
SzemerĆ©di, E., Trotter, W.T.: Extremal Problems in Discrete Geometry. CombinatoricaĀ 3, 381ā392 (1983)
Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, A., Dmitrovsky, E., Lander, E.S., Golub, T.R.: Interpreting Patterns of Gene Expression with Self- Organizing Maps: Methods and Application to Hematopoietic Differentiation. Proc. Natl. Acad. Sci. USAĀ 96, 2907ā2912 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akutsu, T. (2004). Algorithms for Point Set Matching with k-Differences. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive