Characterizing and recognizing weak visibility polygons

Ghosh, Subir Kumar and Maheshwari, Anil and Pal, Sudebkumar Prasant and Saluja, Sanjeev and Madhavan, Veni CE (1993) Characterizing and recognizing weak visibility polygons. In: Computational Geometry, 3 (4). pp. 213-233.

PDF Recognize.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

A polygon is said to be a weak visibility polygon if every point of the polygon is visible from some point of an internal segment. In this paper we derive properties of shortest paths in weak visibility polygons and present a characterization of weak visibility polygons in terms of shortest paths between vertices. These properties lead to the following efficient algorithms: (i) an O(E) time algorithm for determining whether a simple polygon P is a weak visibility polygon and for computing a visibility chord if it exist, where E is the size of the visibility graph of P and (ii) an O(n2) time algorithm for computing the maximum hidden vertex set in an n-sided polygon weakly visible from a convex edge.

Item Type:	Journal Article
Publication:	Computational Geometry
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	02 Feb 2011 08:53
Last Modified:	02 Feb 2011 08:53
URI:	http://eprints.iisc.ac.in/id/eprint/35362

Actions (login required)

View Item