2026-09-22T08:09:33Zhttps://ruor.uottawa.ca/server/oai/request

oai:ruor.uottawa.ca:10393/84552024-02-23T08:56:13Zcom_10393_242col_10393_244

Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights. Fraiji, Nicolas. Urrutia, Jorge, Computer Science. This work presents the solution to three problems in Computational Geometry. First we introduce a theorem to illuminate every triangle with three p6 vertex-floodlights and we provide three proofs. Secondly we show that three p4 vertex-floodlights suffice to illuminate every quadrilateral. Finally we provide a theorem for illuminating a cocircular convex n-gon P of n vertices with a set of k vertex-floodlights, (k ≤ n) whose total sum is pi. 2009-03-23T17:25:29Z 2009-03-23T17:25:29Z 1999 1999 Thesis Source: Masters Abstracts International, Volume: 40-06, page: 1545. 9780612678224 http://hdl.handle.net/10393/8455 http://dx.doi.org/10.20381/ruor-7318 126 p. application/pdf University of Ottawa (Canada)