How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments


Given a simple polygon P with n vertices, the visibility polygon (VP) of a point q (VP(q)), or a segment pq (VP(pq)) inside P can be computed in linear time. We propose a linear time algorithm to extend VP of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment uw can also be seen from the viewer… (More)
DOI: 10.1007/978-3-319-53925-6_4


9 Figures and Tables

Slides referencing similar topics