Some chain visibility problems in a simple polygon

In this paper, the notions of convex chain visibility and reflex chain visibility of a simple polygon P are introduced, and some optimal algorithms concerned with convex- and reflex-chain visibility problems are described. For a convex-chain visibility problem, two linear-time algorithms are exhibit...

Full description

Bibliographic Details
Published in:Algorithmica, Vol. 5, No. 1/4 (1990), p. 485-507
Main Author: Lee, Sang-Ho
Other Involved Persons: Chwa, Kyung-Yong
Format: electronic Article
Item Description:Communicated by Bernard Chazelle.
Physical Description:Online-Ressource
QR Code: Show QR Code