Location of Largest Empty Staircase Polygon Among Point Obstacles.

Author (Researcher Name)

Debashree Ghosh, Indian Statistical InstituteFollow

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)

This dissertation outlines algorithm an for identifying an empty staircase polygon of maximum area, among a set of points distributed on a euclidean plane. The problem is formulated using the concept of permutation grapha and an O(n3) time and O(n2) epace algorithm is proposed.

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

Control Number

ISI-DISS-1992-165

Creative Commons License

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

DOI

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

Recommended Citation

Ghosh, Debashree, "Location of Largest Empty Staircase Polygon Among Point Obstacles." (1993). Master’s Dissertations. 270.
https://digitalcommons.isical.ac.in/masters-dissertations/270