A parallel approximation algorithm for minimum weight triangulation

DOI10.1007/978-3-540-49382-2_21MaRDI QIDQ4247271zbMATH OpenFDO

Authors Joachim Gudmundsson, Christos Levcopoulos

Publication date 18 January 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-49382-2_21

zbMATH Keywords

computational geometryminimum weight triangulationparallel algorithmquasi-greedy triangulation algorithmsurface interpolationtriangulation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1496856
• scientific article; zbMATH DE number 871937
• scientific article; zbMATH DE number 219273
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

Cited in

(5)

• An optimal parallel algorithm for triangulating a set of points in the plane
• A parallel algorithm for minimum weighted colouring of triangulated graphs
• scientific article; zbMATH DE number 1496856 (Why is no real title available?)
• scientific article; zbMATH DE number 219273 (Why is no real title available?)
• Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology

This page was built for publication: A parallel approximation algorithm for minimum weight triangulation

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