The Community for Technology Leaders
RSS Icon
Subscribe
Mesa, Arizona
Apr. 16, 2001 to Apr. 19, 2001
ISBN: 0-7695-1080-9
pp: 0390
Yu-Kumg Chen , Huafan University
Shuo-Yan Chou , National Taiwan University of Science and Technology
Tzong-Chen Wu , National Taiwan University of Science and Technology
ABSTRACT
Abstract: In this paper, a convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q.
CITATION
Yu-Kumg Chen, Shuo-Yan Chou, Tzong-Chen Wu, "An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons", ICDCSW, 2001, 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops, 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops 2001, pp. 0390, doi:10.1109/CDCS.2001.918735
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool