Computing MaxMin edge length triangulations

DOI10.20382/JOCG.V9I1A1MaRDI QIDQ4626286zbMATH OpenOpenAlexFDO

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

Publication date 27 February 2019

Full work available at URL https://jocg.org/index.php/jocg/article/view/3047

Mathematics Subject Classification ID

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

Recommendations

• Computing MaxMin edge length triangulations
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• A linear time algorithm for max-min length triangulation of a convex polygon
• 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?)
• scientific article; zbMATH DE number 1953077 (Why is no real title available?)
• Computing MaxMin edge length triangulations
• Exact algorithms for minimum dilation triangulation
• Solving the minimum convex partition of point sets with integer programming

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 Q4626286)