Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
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.
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Raymond Wu, Jie Lu
ITA Conference 2007
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)