Abstract
In this paper, we study the problem of calculating the minimum collision distance between two planar convex polygons when one of them moves to another along a given direction. First, several novel concepts and properties are explored, then an optimal algorithm OPFIV with time complexityO (log (n+m)) is developed and its correctness and optimization are proved rigorously.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Huang Wenqi and Zhan Shuhao, Quasi-physical method in solving packing problem.Acta Mathematicae Applicatae Sinica, 1979, pp. 176–180.
Huang Wenqi, Li Qinhua and Yu Xiangdong, Quasi-physical method in solving space packing problem.Acta Mathematicae Applicatae Sinica, 1986, 9 (4). pp. 443–453.
Dorit S. Hochbaum and Wolfgang Mass, Approximation schemes for covering and packing problems in image processing and VLSI.J. of ACM, 1985, 32 (1). 0734 0752 V
Li Qinhua, Yan Yong and Liu Jian, An Approximation algorithms for packing problems of planar convex polygons.Scientia Sinica (seriesA), June, 1992, pp. 638-
B. Chazlle and D. P. Dobkin, Intersection of convex objects in two and three dimensions.J. of ACM, 1987, 36(1), pp. 1–27.
Li Hui, Decision algorithm of movability of convex polygons.Scientia Sinica (Series A), 1987, (12) pp. 1301–1308.
Kurt Mehlhom, Data Structures and Algorithms 3: Multi-dimensional searching and Computational Geometry. Springer-Verlag, Berlin, Heidelberg, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yan, Y. An optimal algorithm for solving collision distance between convex polygons in plane. J. of Compt. Sci. & Technol. 8, 367–373 (1993). https://doi.org/10.1007/BF02939545
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939545