The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon.

Date of Submission

December 2002

Date of Award

Winter 12-12-2003

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Sur-Kolay, Susmita (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Smallest rectilinear paths are rectilinear paths with a minimum lenth and a minitmum number of bends simultaneously. Given two pairs of terminals within a rectilinear polygon, we describe an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of lenths and total number of bends are both minimized. But such a smallest pair may not exist for some problem instance. In that case, the algorithm presented will find, among all non crossing paths with a minimum total length, a pair whose total length is the shortest, or find, among all noncrossing paths with a minimum total length, a pair whose total number of bends is minimized. We describe a simple linear time and space algorithm based On the fact that there are only a limited nunmber of configurations of such a solution pair.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843103

Control Number

ISI-DISS-2002-99

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6271

This document is currently not available here.

Share

COinS