Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.

dc.contributor.advisor	Urrutia, Jorge,
dc.contributor.author	Fraiji, Nicolas.
dc.date.accessioned	2009-03-23T17:25:29Z
dc.date.available	2009-03-23T17:25:29Z
dc.date.created	1999
dc.date.issued	1999
dc.degree.level	Masters
dc.degree.name	M.C.S.
dc.description.abstract	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.
dc.format.extent	126 p.
dc.identifier.citation	Source: Masters Abstracts International, Volume: 40-06, page: 1545.
dc.identifier.isbn	9780612678224
dc.identifier.uri	http://hdl.handle.net/10393/8455
dc.identifier.uri	http://dx.doi.org/10.20381/ruor-7318
dc.publisher	University of Ottawa (Canada)
dc.subject.classification	Computer Science.
dc.title	Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.
dc.type	Thesis

Files

Now showing 1 - 1 of 1