Visibility Via Reflection, Ph.D. Dissertation Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
This document deals with the following results in details:Given a simple polygon P with $n$ vertices, the visibility polygon (VP) of a point q, or a segment pq inside P can be computed in linear time. It is known that the visibility polygon of a point inside a polygon in the presence of a mirror can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment) by converting some edges of P into mirrors (reflecting-edges with specular type of reflection), such that a given non-visible segment uw can also be seen from the viewer.Various definitions for the visibility of a segment, such as weak, strong, or complete visibility, are considered. Our...
Cataloging briefVisibility Via Reflection, Ph.D. Dissertation Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
This document deals with the following results in details:Given a simple polygon P with $n$ vertices, the visibility polygon (VP) of a point q, or a segment pq inside P can be computed in linear time. It is known that the visibility polygon of a point inside a polygon in the presence of a mirror can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment) by converting some edges of P into mirrors (reflecting-edges with specular type of reflection), such that a given non-visible segment uw can also be seen from the viewer.Various definitions for the visibility of a segment, such as weak, strong, or complete visibility, are considered. Our...
Find in contentBookmark
|
|