Showing cs.CGShow all
2 papers · 1 filter
cs.CG2018
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…