Physical Sciences and Mathematics Commons^™

Studies On Kernels Of Simple Polygons, Jason Mark

UNLV Theses, Dissertations, Professional Papers, and Capstones

The kernel of a simple polygon is the set of points in its interior from which all points inside the polygon are visible. We formally establish that for a given convex polygon Q we can always construct a larger simple polygon with many reflex vertices such that Q is the kernel of P. We present algorithms for decomposing a strongly monotone polygon into star-polygons. This decomposition is applied for developing an efficient algorithm for placing a small number of vertical towers to cover the entire given 1.5D terrain. We also present an experimental investigation of the proposed algorithm. The implementation …