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