Computation of Minimum Width Rectangular Annulus.

Date of Submission

December 2010

Date of Award

Winter 12-12-2011

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

In this work we consider the problem of finding two parallel rectan- gles in arbitrary orientation one rectangle contained in another such that given a point set the entire point set is contained within the annulus formed by the two rectangles and the maximum euclidean distance between any two sides of the possible pair of rectangles is minimized. We propose an algorithm of time complexity O(n2logn) with a preprocessing time of O(n³) and space comlexity O(n2).


ProQuest Collection ID:

Control Number


Creative Commons License

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


This document is currently not available here.