Maximizing the Guarded Interior of an Art Gallery

Emiris, I; Fragoudakis, C; Markou, E

dc.contributor.author	Emiris, I	en
dc.contributor.author	Fragoudakis, C	en
dc.contributor.author	Markou, E	en
dc.date.accessioned	2014-03-01T02:50:16Z
dc.date.available	2014-03-01T02:50:16Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35003
dc.relation.uri	http://eurocg.org/06/delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/40.pdf	en
dc.relation.uri	http://users.ucg.gr/~emarkou/publications/file_list/efmpdf.pdf	en
dc.relation.uri	http://www.cs.uoi.gr/~emarkou/greek/id133/filelist/efmpdf.pdf	en
dc.relation.uri	http://users.ucg.gr/~emarkou/greek/id133/filelist/efmpdf.pdf	en
dc.relation.uri	http://www.cs.uoi.gr/~emarkou/publications/file_list/efmpdf.pdf	en
dc.subject	Art Gallery Problem	en
dc.subject	Polynomial Time Algorithm	en
dc.title	Maximizing the Guarded Interior of an Art Gallery	en
heal.type	conferenceItem	en
heal.publicationDate	2006	en
heal.abstract	In the Art Gallery problem a polygon is given and the goal is to place as few guards as possible so that the entire area of the polygon is covered. We ad- dress a closely related problem: how to place a fixed number of guards on the vertices or the edges of a simple polygon so that the total guarded	en
heal.journalName	European Workshop on Computational Geometry	en