Approximating the MaxMin and MinMax area triangulations using angular constraints

MaRDI QIDQ3000094zbMATH OpenFDO

Authors J. Mark Keil, Tzvetalin S. Vassilev

Publication date 18 May 2011

Full work available at URL https://eudml.org/doc/11392

zbMATH Keywords

algorithmsangle restricted triangulationapproximationcomputational geometryDelauney triangulationMaxMin area triangulationMinMax area triangulationplanar point settriangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• scientific article; zbMATH DE number 742947
• Quadratic time computable instances of MaxMin and MinMax area triangulations of convex polygons
• Algorithms for optimal area triangulations of a convex polygon
• LMT-skeleton heuristics for several new classes of optimal triangulations

Cited in

(2)

• Algorithms for optimal area triangulations of a convex polygon
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation

This page was built for publication: Approximating the MaxMin and MinMax area triangulations using angular constraints

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