UPM Digital Archive (Technical University of Madrid) · 2011 · 10 citations · 2 references
Open access
ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsGeometric ApproximationGeometric OptimizationGeometry ProcessingExperimental Study DesignPolygonal ApproximationPolygonization
Abstract. 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 different 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.
2
Heuristics for the Generation of Random Polygons
Thomas Auer, Martin Held · 1996 · 97 citations
Polygonizations of point sets in the plane
Linda L. Deneen, Gary Shute · Discrete & Computational Geometry · 1988 · 21 citations · Full text