Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
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.
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003