scientific article; zbMATH DE number 1496856

MaRDI QIDQ4500844zbMATH OpenFDO

Authors Joachim Gudmundsson, Christos Levcopoulos

Publication date 25 March 2001

zbMATH Keywords

minimum weight triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1302028
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• A grid-based approximation algorithm for the minimum weight triangulation problem
• scientific article; zbMATH DE number 742947
• A parallel algorithm for minimum weighted colouring of triangulated graphs
• Approximating minimum-weight triangulations in three dimensions
• A linear-time approximation scheme for minimum weight triangulation of convex polygons
• An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
• An optimal parallel algorithm for triangulating a set of points in the plane

Cited in

(4)

• scientific article; zbMATH DE number 219273 (Why is no real title available?)
• An optimal parallel algorithm for triangulating a set of points in the plane
• scientific article; zbMATH DE number 871937 (Why is no real title available?)
• A quasi-polynomial time approximation scheme for minimum weight triangulation

This page was built for publication:

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