Computing MaxMin edge length triangulations

DOI10.1137/1.9781611973754.6MaRDI QIDQ5232522zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Computing MaxMin edge length triangulations
• A linear time algorithm for max-min length triangulation of a convex polygon
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• Edge insertion for optimal triangulations
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation

Cited in

(5)

• scientific article; zbMATH DE number 1163631 (Why is no real title available?)
• Computing MaxMin edge length triangulations
• NP-completeness for minimizing maximum edge length in grid embeddings
• scientific article; zbMATH DE number 1953077 (Why is no real title available?)
• Computing diverse and nice triangulations

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Computing MaxMin edge length triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232522)