Approaching minimum area polygonization

Autores
Taranilla, María Teresa; Gagliardi, Edilma Olinda; Hernández Peñalver, Gregorio
Año de publicación
2011
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Presentado en el XII Workshop Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
simple polygons; minimum area polygonization; computational geometry; geometric structures optimization
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/18574
Acceder
id SEDICI_c3562a6d05f14a20dd143b78e1ccba06
oai_identifier_str oai:sedici.unlp.edu.ar:10915/18574
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Approaching minimum area polygonizationTaranilla, María TeresaGagliardi, Edilma OlindaHernández Peñalver, GregorioCiencias Informáticassimple polygons; minimum area polygonization; computational geometry; geometric structures optimizationThe 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.Presentado en el XII Workshop Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2011-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf31-40http://sedici.unlp.edu.ar/handle/10915/18574enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:53:32Zoai:sedici.unlp.edu.ar:10915/18574Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:53:32.758SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Approaching minimum area polygonization
title Approaching minimum area polygonization
spellingShingle Approaching minimum area polygonization
Taranilla, María Teresa
Ciencias Informáticas
simple polygons; minimum area polygonization; computational geometry; geometric structures optimization
title_short Approaching minimum area polygonization
title_full Approaching minimum area polygonization
title_fullStr Approaching minimum area polygonization
title_full_unstemmed Approaching minimum area polygonization
title_sort Approaching minimum area polygonization
dc.creator.none.fl_str_mv Taranilla, María Teresa
Gagliardi, Edilma Olinda
Hernández Peñalver, Gregorio
author Taranilla, María Teresa
author_facet Taranilla, María Teresa
Gagliardi, Edilma Olinda
Hernández Peñalver, Gregorio
author_role author
author2 Gagliardi, Edilma Olinda
Hernández Peñalver, Gregorio
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
simple polygons; minimum area polygonization; computational geometry; geometric structures optimization
topic Ciencias Informáticas
simple polygons; minimum area polygonization; computational geometry; geometric structures optimization
dc.description.none.fl_txt_mv 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.
Presentado en el XII Workshop Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/18574
url http://sedici.unlp.edu.ar/handle/10915/18574
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
31-40
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615791607021568
score 13.070432

Publicaciones similares