A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

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

2003
*
Computational geometry
*

This paper presents an algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor. A staircase polygon is an isothetic polygon bounded by two monotonically rising (falling) staircases. A monotonically rising staircase is a sequence of alternatingly horizontal and vertical line segments from the bottom-left corner of the floor to its top-right corner such that for every pair of points α = (x α , y α ) and β = (x β , y β ) on

doi:10.1016/s0925-7721(03)00015-4
fatcat:u6xnkzrs7zcxrlbvyh7vo7bwnq