Urrutia, Jorge,Fraiji, Nicolas.2009-03-232009-03-2319991999Source: Masters Abstracts International, Volume: 40-06, page: 1545.9780612678224http://hdl.handle.net/10393/8455http://dx.doi.org/10.20381/ruor-7318This 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.126 p.Computer Science.Thesis