Das, Gautam Kumar2016-07-042016-07-04200234p.http://hdl.handle.net/10263/6271Dissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM UnitenAlgorithmsRectilinear polygonNoncrossing pathsThe smallest pair of noncrossing paths in a rectilinear polygonThesis