The smallest pair of noncrossing paths in a rectilinear polygon
| dc.contributor.author | Das, Gautam Kumar | |
| dc.date.accessioned | 2016-07-04T17:24:35Z | |
| dc.date.available | 2016-07-04T17:24:35Z | |
| dc.date.issued | 2002 | |
| dc.description | Dissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM Unit | en_US |
| dc.identifier.citation | 34p. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/6271 | |
| dc.language.iso | en | en_US |
| dc.publisher | Indian Statistical Institute, Kolkata | en_US |
| dc.relation.ispartofseries | Dissertation;2002-99 | |
| dc.subject | Algorithms | en_US |
| dc.subject | Rectilinear polygon | en_US |
| dc.subject | Noncrossing paths | en_US |
| dc.title | The smallest pair of noncrossing paths in a rectilinear polygon | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- DISS-99.PDF
- Size:
- 593.61 KB
- Format:
- Adobe Portable Document Format
- Description:
- Dissertation is the original PDF
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: