Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.
type: CreativeWork
description: 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 &le; n) whose total sum is pi.
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 &le; n) whose total sum is pi.
author: Fraiji, Nicolas.
keywords: Computer Science.
identifier: Source: Masters Abstracts International, Volume: 40-06, page: 1545.
date published: 2009-03-23T17:25:29Z
date modified: 2026-07-24T03:39:20Z
provider: University of Ottawa
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: University of Ottawa (Canada)

PropertyValue
property ID: Handle
value: http://hdl.handle.net/10393/8455

PropertyValue
property ID: DOI
value: 10.20381/ruor-7318