Connected Covering on a Rectangulared Planar Subdivision

Please enable javascript in your browser.

Khojamli, Halime | 2013

447 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44660 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Zarei, Ali Reza
Abstract:
This thesis is concerned with a fundamental problem in computational geometry. This problem inspects covering a space with a set of points provided that each point of the space is visible to at least one point from the selected subset. Applications of these problems are in the areas such as geographic information systems (GIS), robotics,computer graphics and the military.The investigated space is a planar rectangular region which is partitioned into smaller rectangles by connected edges. The objective of this study is to find an optimized corridor; i.e., a connected subset of edges which contains at least one point from each rectangle. For the minimum diameter corridor problem, an exact polynomial time algorithm and for the minimum length corridor problem, an approximation algorithm is presented
Keywords:
Computational Geometry ; Minimum Corridor Connection ; Corridors ; Approximate Algorithm