Author:
Datta Amitava,Ramkumar G. D. S.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Aggarwal,A. and Suri,S., "Fast Algorithms for Computing the Largest Empty Rectangle", Proc. of the Third Annual ACM Symposium on Computational Geometry, pp.278–290, 1987.
2. Aggarwal,A. and Suri,S., "Fast Algorithms for Computing Largest Empty Rectangles", Manuscript, 1989.
3. Aggarwal, A., Klawe, M., Moran, S., Shor, P., and Wilber, R., "Geometric Applications of a Matrix-Searching Algorithm", Algorithmica,2, pp.195–208,1987.
4. Boyce, J.E., Dobkin, D.P., Drysdale, R.L., and Guibas, L.J., "Finding extremal polygons," SIAM J. on Comput.,Vol.14,pp.134–147,1985.
5. Chang,J.S., and Yap,C.K., "A polynomial solution to potato-peeling and other polygon inclusion and enclosure problems," Proc. 25th IEEE Symp. on Foundations of Computer Science, 1984.