Busque entre los 166596 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-07-11T14:38:35Z | |
dc.date.available | 2012-07-11T14:38:35Z | |
dc.date.issued | 2011 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/18574 | |
dc.description.abstract | The problem of fi nding a minimum area polygonization for a given set of points in the plane, Minimum Area Polygonization (MAP) is NP-hard. Due to the complexity of the problem we aim at the development of algorithms to obtain approximate solutions. In this work, we suggest di feerent strategies in order to minimize the polygonization area.We propose algorithms to search for approximate solutions for MAP problem. We present an experimental study for a set of instances for MAP problem. | en |
dc.format.extent | 31-40 | es |
dc.language | en | es |
dc.subject | simple polygons; minimum area polygonization; computational geometry; geometric structures optimization | en |
dc.title | Approaching minimum area polygonization | es |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Taranilla, María Teresa | es |
sedici.creator.person | Gagliardi, Edilma Olinda | es |
sedici.creator.person | Hernández Peñalver, Gregorio | es |
sedici.description.note | Presentado en el XII Workshop Agentes y Sistemas Inteligentes (WASI) | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2011-10 | |
sedici.relation.event | XVII Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |