The smallest pair of noncrossing paths in a rectilinear polygon
No Thumbnail Available
Files
Date
2002
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Indian Statistical Institute, Kolkata
Abstract
Description
Dissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM Unit
Keywords
Algorithms, Rectilinear polygon, Noncrossing paths
Citation
34p.
