Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/6271| Title: | The smallest pair of noncrossing paths in a rectilinear polygon |
| Authors: | Das, Gautam Kumar |
| Keywords: | Algorithms Rectilinear polygon Noncrossing paths |
| Issue Date: | 2002 |
| Publisher: | Indian Statistical Institute, Kolkata |
| Citation: | 34p. |
| Series/Report no.: | Dissertation;2002-99 |
| Description: | Dissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM Unit |
| URI: | http://hdl.handle.net/10263/6271 |
| Appears in Collections: | Dissertations - M Tech (CS) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| DISS-99.PDF | Dissertation is the original PDF | 593.61 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.