Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm. © 1989.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design