Approaching minimum area polygonization
| Data(s) |
2011
|
|---|---|
| Resumo |
The problem of finding 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?erent 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. |
| Formato |
application/pdf |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Facultad de Informática (UPM) |
| Relação |
http://oa.upm.es/19287/1/INVE_MEM_2011_121744.pdf http://hdl.handle.net/10915/18574 info:eu-repo/semantics/altIdentifier/doi/null |
| Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
| Fonte |
XVII Congreso Argentino de Ciencias de la Computación | XVII Congreso Argentino de Ciencias de la Computación 2011 | 10/10/2011 - 14/10/2011 | La Plata, Argentina |
| Palavras-Chave | #Informática |
| Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |
