"Location of Largest Isothetic Empty Rectangle Among Arbitrarily Orient" by Arani Sinha

Location of Largest Isothetic Empty Rectangle Among Arbitrarily Oriented Line Segments.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

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

Bhattacharya, Bhargab Bikram (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

In this diasertation, we conaider the following problem of computational geometry which has direct application to VLSI layout design : elven a set of arbitrarily oriented non-intersecting line segmenta in a rectangular floor, identify isothetic emf J an rectangle of maximum area. An algorithm has been proposed for th problem which uaes a novel data atructure called 1ine-search-tree is o(n2log3n) The time complexity of our algorithm and O(nlogn) apace.

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:28842800

Control Number

ISI-DISS-1992-

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/2186

This document is currently not available here.

Share

COinS