Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
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.
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering