A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids

Abstract Given a set of n points in R 2 bounded within a rectangular floor F, and a rectangular plate P of specified size, we consider the following two problems: find an isothetic position of P such that it encloses (i) maximum and (ii) minimum number of points, keeping P totally contained within F. For both of these problems, a new algorithm based on interval tree data structure is presented, which runs in O(nlogn) time and consumes O(n) space. If polygonal objects of arbitrary size and shape are distributed in R 2, the proposed algorithm can be tailored for locating the position of the plate to enclose maximum or minimum number of objects with the same time and space complexity. Finally, the algorithm is extended for identifying a cuboid, i.e., a rectangular parallelepiped that encloses maximum number of polyhedral objects in R 3. Thus, the proposed technique serves as a unified paradigm for solving a general class of enclosure problems encountered in computational geometry and pattern recognition.

[1]  Subhas Chandra Nandi.  Studies on some geometric algorithms with applications to VLSI , 1994 .

[2]  Bernard Chazelle.  Filtering Search: A New Approach to Query-Answering , 1983, FOCS.

[3]  Bhargab B Bhattacharya,et al.  Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design , 1990, FSTTCS.

[4]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[5]  D. T. Lee,et al.  An Improved Algorithm for the Rectangle Enclosure Problem , 1982, J. Algorithms.

[6]  Der-Tsai Lee,et al.  Maximum Clique Problem of Rectangle Graphs , 1983 .

[7]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[8]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.

[9]  Bernard Chazelle.  An Improved Algorithm for the Fixed-Radius Neighbor Problem , 1983, Inf. Process. Lett..

[10]  D. T. Lee,et al.  On the maximum empty rectangle problem , 1984, Discret. Appl. Math..

[11]  Bernard Chazelle,et al.  Optimal Solutions for a Class of Point Retrieval Problems , 1985, J. Symb. Comput..

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[14]  George S. Lueker,et al.  A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[15]  Der-Tsai Lee.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[16]  Bernard Chazelle,et al.  Computing the Largest Empty Rectangle , 1984, SIAM J. Comput..

[17]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.