Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/4770| Title: | On finding an empty stair case polygon of largest area (width) in a planar point-set |
| Authors: | Nandy, Subhas C Bhattacharya, Bhargab B |
| Keywords: | Geometric graph theory Permutation graphs Algorithms Complexity |
| Issue Date: | Oct-2003 |
| Citation: | Computational Geometry,v.26, no. 2, p. 143–171 |
| URI: | http://hdl.handle.net/10263/4770 |
| Appears in Collections: | Mathematics and Statistics |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| On finding an empty staircase polygon of largest area (width).pdf | 1.63 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.