Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/8932
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ana Paula Tomás | pt |
dc.contributor.author | António Leslie Bajuelos | pt |
dc.contributor.author | Fábio Marques | pt |
dc.date.accessioned | 2012-09-03T14:05:42Z | - |
dc.date.available | 2012-09-03T14:05:42Z | - |
dc.date.issued | 2006-01 | - |
dc.identifier.uri | http://hdl.handle.net/10773/8932 | - |
dc.description.abstract | We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. It is known that this is an NP-hard Art Gallery Problem with relevant practical applications. In this paper we present an approximation method that solves the problem by successive approximations, which we introduced in [21]. We report on some results of its experimental evaluation and describe two algorithms for characterizing visibility from a point, that we designed for its implementation. | pt |
dc.language.iso | eng | pt |
dc.relation | Programa de Financiamento Plurianual, Fundação para a Ciência e Tecnologia, Programa POSI, CEOC (Univ. of Aveiro) Programa POCTI, FCT, co-financed by EC fund FEDER | pt |
dc.rights | openAccess | por |
dc.title | On Visibility Problems in the Plane - Solving Minimum Vertex Guards by Successive Approximations | pt |
dc.type | conferenceObject | pt |
dc.peerreviewed | yes | pt |
ua.publicationstatus | published | pt |
ua.event.date | 4 Janeiro, 2006 | pt |
ua.event.type | conference | pt |
degois.publication.title | Ninth International Symposium on Artificial Intelligence and Mathematics | pt |
dc.relation.publisherversion | http://anytime.cs.umass.edu/aimath06/ | pt |
Appears in Collections: | ESTGA - Comunicações |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2006 AIMATH apt-alb-fm.pdf | 535.19 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.