A Novel Approach for Reconstructing Paths Using Visibility Graph

Please enable javascript in your browser.

Javan, Majid | 2017

377 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 50323 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Zarei, Alireza
Abstract:
Visibility graph is a graph that comprises information about visibility of a set of objects in 2 or 3-dimensional space. By constructing this graph with respect to conditions of environment one can answer questions like minimum Euclidean distance. Inverse of this procedure is required too; i.e. knowing geometrical structure of objects and information about their visibility we want to guess their location in space and, as the saying goes, reconstruct the environment. For example some methods to reconstruct specific polygons knowing which vertices each vertex sees is proposed. In this dissertation we try to reconstruct a 2-dimensional environment that only has two x-monotone paths (chains)
Keywords:
Computational Geometry ; Visibility Graph ; Reconstruction ; Monotone Polygonal Chain

No TOC