Finding the largest empty rectangle on a grated surface
Publisher
Springer-Verlag
Reference5 articles.
1. Bellman, R. E., Dynamic Programming, Princeton University Press, 1957. 2. Bentley, J. L., Faust, M. G., and Preparata, F. P., “Approximation algorithms for convex hulls,” Communications of the ACM 25, 1 (January 1982), 64–68. 3. Chazelle, B., Drysdale, III, R. L., and Lee, D. T., “Computing the largest empty rectangle,” STACS 84: Symposium of Theoretical Aspects of Computer Science (Fontet, M., and Mehlhorn, K., Eds.), Lecture Notes in Computer Science 166, April 1984, 43–54. 4. Naamad, A., Lee, D. T., and Hsu, W.-L., “On the maximum empty rectangle problem,” Discrete Applied Mathematics 8, 3(July 1984), 267–277. 5. Nievergelt, J., and Preparata, F. P., “Plane-sweep algorithms for intersecting geometric figures,” Communications of the ACM 25, 10(October 1982), 739–747.
|
|