Recognition of largest empty orthoconvex polygon in a point set

Authors:
Subhas C. Nandy;Krishnendu Mukhopadhyaya;Bhargab B. Bhattacharya
Affiliations:
Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata - 700 108, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata - 700 108, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata - 700 108, India
Venue:
Information Processing Letters
Year:
2010

Citing 12
Cited 0

Applications of computational geometry to VLSI layout pattern design

Integration, the VLSI Journal
Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry
Widest empty L-shaped corridor

Information Processing Letters
Finding the largest area axis-parallel rectangle in a polygon

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
On Some Largest Empty Orthoconvex Polygons in a Point Set

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Location of the Largest Empty Rectangle among Arbitrary Obstacles

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Finding extremal polygons

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On finding an empty staircase polygon of largest area (width) in a planar point-set

Computational Geometry: Theory and Applications
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)

Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)
Extremal problems for convex polygons

Journal of Global Optimization
Improved algorithm for the widest empty 1-corner corridor

Information Processing Letters
Finding the orthogonal hull of a digital object: a combinatorial approach

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.89

Visualization

Abstract

An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points on a 2D rectangular region, is presented. The worst-case time and space complexities of the proposed algorithm are O(n^3) and O(n^2) respectively.