A Triangulation and Guard Sufficiency Set of the Hierarchy of Simple Polygons


The KIPS Transactions:PartA, Vol. 15, No. 5, pp. 295-300, Oct. 2008
10.3745/KIPSTA.2008.15.5.295,   PDF Download:

Abstract

In this paper, we consider a characterization of a Guard Sufficiency Set(GSS) in the hierarchy of simple polygons. we propose the diagonals of a arbitrary triangulation of a polygon as a GSS when guards see the diagonals with completely visibility and both sides of the diagonal. we show that this can be a GSS in convex polygons, unimodal polygons, spiral polygons but this can not be a GSS in star-shaped polygons, monotone polygons, completely external visible polygons.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. C. Yang, "A Triangulation and Guard Sufficiency Set of the Hierarchy of Simple Polygons," The KIPS Transactions:PartA, vol. 15, no. 5, pp. 295-300, 2008. DOI: 10.3745/KIPSTA.2008.15.5.295.

[ACM Style]
Tae Cheon Yang. 2008. A Triangulation and Guard Sufficiency Set of the Hierarchy of Simple Polygons. The KIPS Transactions:PartA, 15, 5, (2008), 295-300. DOI: 10.3745/KIPSTA.2008.15.5.295.