Computing MaxMin Edge Length Triangulations

DOI10.1137/1.9781611973754.6zbMath1430.68369OpenAlexW2399879439MaRDI QIDQ5232522

Michael Hemmer, Arne Schmidt, Julian Troegel, Sándor P. Fekete, Winfried Hellmann

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973754.6

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• CPLEX

This page was built for publication: Computing MaxMin Edge Length Triangulations