Generation of Random Simple Polygons and its Visibility Graph.

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


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Nandy, Subhas Chandra (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

The problem of randomly generating simple polygons is of considerable im- portance in the practical evaluation of algorithms that operate on polygons by generating test instances, where it is necessary to check the correctness and to determine the CPU- consumption of an algorithm ezperimentally.Till now no polynomial solution for uniformly random generation of polłygon is known. Auer and Held2), considered a class.of heuristics for this problem. In this thesis, we present an algorithm for the generation of simple random polygon in random manner after a prepro- cessing which takes O(n3logn) time. Though the worst time required to generate a polygon may be O(n3,) the actual CPU time needed for the generation is very less.We also considered finding the visibility graph of those generated random simple polygons which will be helpful for many problems. We considered already ezisting algorithms for this purpose


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.