Computing the Largest Empty Rectangle
Published in SIAM Journal on Computing • Feb 1, 1986
NobleIDNI2P02W61R43S05
Authors:,,
B. Chazelle
R. L. Drysdale
D. T. Lee
Abstract
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!