Approaching minimum area polygonization

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Taranilla, María Teresa, Gagliardi, Edilma Olinda, Hernández Peñalver, Gregorio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
simple polygons; minimum area polygonization; computational geometry; geometric structures optimization
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/18574
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
Descripción
Sumario: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.

Ejemplares similares