Share Email Print

Proceedings Paper

Computing stair-case visibility polygon
Author(s): Laxmi P. Gewali
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Given a point q in the presence of polygonal obstacles, the set of points visible from q is the visibility polygon from q. We consider the problem of computing visibility polygon under stair-case visibility (s-visibility, in short). We show that the s-visibility polygon from a point inside a simple orthogonal polygon of n sides can be computed in O(n) time. When the polygon contains holes the algorithm runs in O(n log n) time, which we prove to be optimal by linear time reduction from sorting. We also consider the problem of recognizing stair-case star polygons (s-star, in short) and present an algorithm which recognizes simple s-star polygons in O(n) time.

Paper Details

Date Published: 1 December 1993
PDF: 12 pages
Proc. SPIE 2060, Vision Geometry II, (1 December 1993); doi: 10.1117/12.164994
Show Author Affiliations
Laxmi P. Gewali, Univ. of Nevada/Las Vegas (United States)

Published in SPIE Proceedings Vol. 2060:
Vision Geometry II
Robert A. Melter; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?