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

Nandy, Subhas CBhattacharya, Bhargab B2012-11-122012-11-122003-10Computational Geometry,v.26, no. 2, p. 143–171http://hdl.handle.net/10263/4770enGeometric graph theoryPermutation graphsAlgorithmsComplexityOn finding an empty stair case polygon of largest area (width) in a planar point-setArticle