Efficient Visibility Computation and Simplification in Different Environments, Ph.D. Dissertation Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
In this thesis, we considered several types of the visibility problem. These problems include computing the visibility polygon of a point observer inside a polygonal domain, maintaining visibility polygon of a moving point observer, visibility coherence in space, maintaining visibility polygon of a moving segment observer and visibility dependent simplification. Furthermore, we considered these problems in both offline and streaming settings. These problems arise in different practical areas, such as computer graphics, machine vision, robotics, motion planning, geographic information systems (GIS) and computational geometry. We obtained effective theoretical results as well as superior...
Cataloging briefEfficient Visibility Computation and Simplification in Different Environments, Ph.D. Dissertation Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
In this thesis, we considered several types of the visibility problem. These problems include computing the visibility polygon of a point observer inside a polygonal domain, maintaining visibility polygon of a moving point observer, visibility coherence in space, maintaining visibility polygon of a moving segment observer and visibility dependent simplification. Furthermore, we considered these problems in both offline and streaming settings. These problems arise in different practical areas, such as computer graphics, machine vision, robotics, motion planning, geographic information systems (GIS) and computational geometry. We obtained effective theoretical results as well as superior...
Find in contentBookmark |
|