1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CG2021
Computing Area-Optimal Simple Polygonizations
Sándor P. Fekete, Andreas Haas, Phillip Keldenich +2
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-…
cs.CG2018★ 1 cited
Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality
Andreas Haas
We consider practical methods for the problem of finding a minimum-weight triangulation (MWT) of a planar point set, a classic problem of computational geometry with many applicati…
cs.CG2016
Computing Nonsimple Polygons of Minimum Perimeter
Sándor P. Fekete, Andreas Haas, Michael Hemmer +8
We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertic…