Largest empty rectangle

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Maximum Empty Rectangles (in green) with different bounding objects (with black outline) . The light green rectangle would be suboptimal (non-maximal) solution. A-C are axis oriented - parallel to axes of the light blue "floor" and also examples of.[1] E shows an MER with arbitrary orientation

In computational geometry, the largest empty rectangle problem,[2] maximal empty rectangle problem[3] or maximum empty rectangle problem,[4] is the problem of finding a rectangle of maximal size to be placed among obstacles in the plane. There are a number of variants of the problem, depending on the particularities of this generic formulation, in particular, depending on the measure of the "size", domain (type of obstacles), and the orientation of the rectangle.

The problems of this kind arise e.g., in electronic design automation, in design and verification of physical layout of integrated circuits.[5]

A maximal empty rectangle (MER) is a rectangle which is not contained in another empty rectangle. Each side of a MER abuts an obstacle (otherwise the side may be shifted outwards, increasing the empty rectangle). An application of this kind is enumeration of "maximal white rectangles" in image segmentation R&D of image processing and pattern recognition.[6] In the contexts of many algorithms for largest empty rectangles, "maximal empty rectangles" are candidate solutions to be considered by the algorithm, since it is easily proven that, e.g., a maximum-area empty rectangle is a maximal empty rectangle.

Classification[edit]

In terms of size measure, the two most common cases are the largest-area empty rectangle and largest-perimeter empty rectangle.[7]

Another major classification is whether the rectangle is sought among axis-oriented or arbitrarily oriented rectangles.

Special cases[edit]

Maximum-area square[edit]

The case when the sought rectangle is an axis-oriented square may be treated using Voronoi diagrams in L_1metrics for the corresponding obstacle set, similarly to the largest empty circle problem. In particular, for the case of points within rectangle an optimal algorithm of time complexity \Theta(n \log n) is known.[8]

Domain: rectangle containing points[edit]

A problem first discused by Naamad, Lee and Hsu in 1983[1] is stated as follows: given a rectangle A containing n points, find a largest-area rectangle with sides parallel to those of A which lies within A and does not contain any of the given points. Naamad, Lee and Hsu presented an algorithm of time complexity O(\min(n^2,s \log n)), where s is the number of feasible solutions, i.e., maximal empty rectangles. They also proved that s= O(n^2) and gave an example in which s is quadratic in n. Afterwards a number of papers presented better algorithms for the problem.

Domain: line segment obstacles[edit]

The problem of empty isothetic rectangles among isothetic line segments was first considered[9] in 1990.[10] Later a more general problem of empty isothetic rectangles among non-isothetic obstacles was considered.[9]

Generalizations[edit]

Higher dimensions[edit]

In 3-dimensional space, algorithms are known for finding a largest maximal empty isothetic cuboid problem, as well as for enumeration of all maximal isothetic empty cuboids.[11]

See also[edit]

References[edit]

  1. ^ a b A. Naamad, D. T. Lee and W.-L. Hsu (1984). "On the Maximum Empty Rectangle Problem". Discrete Applied Mathematics: 267–277. doi:10.1016/0166-218X(84)90124-0. 
  2. ^ Search Google Scholar for "largest empty rectangle" term usageDo not use Template:Google scholar cite in articles as Google links are not appropriate for an encyclopedia
  3. ^ Search Google Scholar for "maximal empty rectangle" term usageDo not use Template:Google scholar cite in articles as Google links are not appropriate for an encyclopedia
  4. ^ Search Google Scholar for "maximum empty rectangle" term usageDo not use Template:Google scholar cite in articles as Google links are not appropriate for an encyclopedia
  5. ^ Jeffrey Ullman (1984). "Ch.9: Algorithms for VLSI Design Tools". Computational Aspects of VLSI. Computer Science Press. ISBN 0-914894-95-1.  describes algorithms for polygon operations involved in electronic design automation (design rule checking, circuit extraction, placement and routing).
  6. ^ Baird, H. S., Jones, S. E., Fortune, S.J. (1990). "Image segmentation by shape-directed covers". Proc. 10th International Conference on Pattern Recognition 1: 820–825. doi:10.1109/ICPR.1990.118223. 
  7. ^ Alok Aggearwal, Subhash Suri (1987). "Fast algorithms for computing the largest empty rectangle". Proc. 3rd Annu. Symposium on Computational Geometry: 278–290. doi:10.1145/41958.41988. 
  8. ^ B. Chazelle, R. L. Drysdale III and D. T. Lee (1984). "Computing the largest empty rectangle". STACS-1984, Lecture Notes in Computer Science 166: 43–54. doi:10.1007/3-540-12920-0_4. 
  9. ^ a b "Location of Largest Empty Rectangle among Arbitrary Obstacles". Foundations of Software Technology and Theoretical Computer Science. p. 159. 
  10. ^ Subhas C Nandy,Bhargab B Bhattacharya,Sibabrata Ray (1990). "Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design". Proc. FST & TCS – 10, Lecture Notes in Computer Science 437: 255–269. doi:10.1007/3-540-53487-3_50. 
  11. ^ S.C. Nandy and B.B. Bhattacharya (1998). "Maximal Empty Cuboids among Points and Blocks". Computers & Mathematics with Applications 36 (3): 11–20. doi:10.1016/S0898-1221(98)00125-4.