On finding an empty staircase polygon of largest area (width) in a planar point-set

DOI10.1016/S0925-7721(03)00015-4zbMath1027.65027OpenAlexW2049717807MaRDI QIDQ1405008

Subhas C. Nandy, Bhargab Bikram Bhattacharya

Publication date: 25 August 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(03)00015-4

zbMATH Keywords

algorithmalgorithm complexitypermutation graphgeometric optimization problemVLSI layout designempty-staircase-polygon of largest area planning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Kinematics of mechanisms and robots (70B15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

On finding a widest empty 1-corner corridor ⋮ On finding widest empty curved corridors ⋮ Recognition of largest empty orthoconvex polygon in a point set ⋮ Maximum Rectilinear Convex Subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Widest empty L-shaped corridor
• On the maximum empty rectangle problem
• Geometric applications of a matrix-searching algorithm
• On a class of \(O(n^ 2)\) problems in computational geometry
• Finding Extremal Polygons
• Computing the Largest Empty Rectangle

This page was built for publication: On finding an empty staircase polygon of largest area (width) in a planar point-set