View : 18 Download: 0

Some chain visibility problems in a simple polygon

Title
Some chain visibility problems in a simple polygon
Authors
Lee S.-H.Chwa K.-Y.
Ewha Authors
이상호
SCOPUS Author ID
이상호scopus
Issue Date
1990
Journal Title
Algorithmica
ISSN
0178-4617JCR Link
Citation
vol. 5, no. 1-4, pp. 485 - 507
Publisher
Springer-Verlag
Indexed
SCI; SCIE; SCOPUS scopus
Abstract
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 exhibited for determining whether or not P is visible from a given convex chain; one is the turn-checking approach and the other is the decomposition approach based on checking edge visibilities. We also present a linear-time algorithm for finding, if any, all maximal convex chains of a given polygon P from which P is visible, where a maximal convex chain is a convex chain which does not properly include any other convex chains. It can be made by showing that there can be at most four visible maximal convex chains in P with an empty kernel. By similar arguments, we show that the same problems for reflex chain visibility can be easily solved in linear time. © 1990 Springer-Verlag New York Inc.
DOI
10.1007/BF01840400
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE