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.identifier.citation	34p.	en_US
dc.identifier.uri	http://hdl.handle.net/10263/6271
dc.description	Dissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM Unit	en_US
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