Abstract
We show that the polygon docking problem can be divided into two subproblems, partial matching of periodic strings and line segment intersection detection. And we show that the docking problem of a pair of polygons is solved in O(n 2) times, where n is the number of edges of polygons. Using this result, we show that construction of an object from a collection of polygons whose elements have no numerical error on the expression of the lengths of edges and the angles between two connecting edges can be solved in O(k 3 n 2) times for k polygons where the maximum number of edges of polygonal-elements is n.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Sandak, B., Nussinov, R., Wolfson, H.J.: Docking of conformatinally flexible proteins. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 271–287. Springer, Heidelberg (1996)
Apostolico, A., Galil, Z. (eds.): Pattern Matching Algorithms. Oxford University Press, New York (1997)
Arkin, M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Michell, S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE, Tr. PAMI 13, 209–216 (1991)
Leung, M.K., Yang, Y.-H.: Dynamic two-strip a lgorithm in curve fitting. Pattern Recognition 23, 69–79 (1990)
Waterman, M.S.: Introduction to Computational Biology, Maps, Sequences and Genomes. Champman & Hall, London (1995)
Fu, K.S.: Syntactic Methods in Pattern Recognition. Academic Press, New York (1974)
Latecki, J.L., Lakämper, R.: Convexity rule for shape decompositions based on discrete contour evolution. CVIU 73, 441–454 (1999)
Radack, G., Badler, N.: Jigsaw puzzle matching using a boundary-centered polar encoding. CGIP 19, 1–17 (1982)
Freeman, H., Garder, L.: A pictorial jigsaw puzzle: The computer solution of a problem in pattern recognition. IEEE, Trans. Electronic Computers 13, 118–127 (1964)
Wolfson, H., Schonberg, E., Kalvib, A., Lamdan, Y.: Solving jigsaw puzzle by computer. Annals of Operations Research 12, 51–64 (1988)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkoph, O.: Computational Geometry: Algorithms ad Applications, Chap.2. Springer, Berlin (1997)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imiya, A., Kudo, S. (2003). Docking of Polygons Using Boundary Descriptor. In: Petkov, N., Westenberg, M.A. (eds) Computer Analysis of Images and Patterns. CAIP 2003. Lecture Notes in Computer Science, vol 2756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45179-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-45179-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40730-0
Online ISBN: 978-3-540-45179-2
eBook Packages: Springer Book Archive