Algorithms for triangulations

MaRDI QIDQ5448995zbMATH OpenFDO

Authors Marian Ioan Munteanu, Ana-Irina Nistor

Publication date 10 March 2008

zbMATH Keywords

computational geometrytriangulationVoronoi diagram

Mathematics Subject Classification ID

Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)

Recommendations

• Triangulations and applications
• scientific article; zbMATH DE number 1182915
• Triangulations. Structures for algorithms and applications
• One method for triangulation a set of points in the plane
• Computational Science and Its Applications – ICCSA 2004

Cited in

(7)

• Computing bushy and thin triangulations
• Flip Algorithm for Segment Triangulations
• A heuristic triangulation algorithm
• scientific article; zbMATH DE number 3179549 (Why is no real title available?)
• scientific article; zbMATH DE number 1163631 (Why is no real title available?)
• Method for finding and storing optimal triangulations based on square matrix
• Triangulations. Structures for algorithms and applications

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Algorithms for triangulations

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