Partitioning Problems.

Date of Submission

December 2008

Date of Award

Winter 12-12-2009

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 thesis we have proposed algorithms for partitioning a region in which we need to equalize the area of region with certain constraints. Given a set of facilities on a rectangular region, here our objective is to partition the region into equal area such that each partition contain one facility and furthest point from facility to its partition region is minimized. In case of two facilities we present an algorithm which equipartition the region (using at most one horizontal line segments) and minimize maximum distance between facility and its furthest point of concave region. If the partition region is separated by a single line segment then an another algorithm is given which present partition if it exits. For general case we propose a heuristics which equipartition the region. We are using Weighted Vornoi Diagram for the division of region and Secant Methods for updating weights.


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.