Implementation of the convex polygon triangulation algorithm

MaRDI QIDQ5403508zbMATH OpenFDO

Authors Muzafer Saračević, Predrag S. Stanimirović, Sead H. Mašović, Enver Biševac

Publication date 26 March 2014

zbMATH Keywords

Hurtado-Noy hierarchytriangulation polygon

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Theory of programming languages (68N15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing triangulations of the convex polygon in PHP/MySQL environment
• A non-recursive algorithm for polygon triangulation
• Triangulating a simple polygon in linear time
• Triangulation and shape-complexity
• FIST: fast industrial-strength triangulation of polygons

Cited in

(6)

• The implementation of an algorithm to find the convex hull of a set of three-dimensional points
• Computing triangulations of the convex polygon in PHP/MySQL environment
• scientific article; zbMATH DE number 2010154 (Why is no real title available?)
• Method for finding and storing optimal triangulations based on square matrix
• Orbiting triangle method for convex polygon triangulation
• Tensor ranks and the fine-grained complexity of dynamic programming

Describes a project that uses

Uses Software

• Python

This page was built for publication: Implementation of the convex polygon triangulation algorithm

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