One method for triangulation a set of points in the plane

MaRDI QIDQ3464376zbMATH OpenFDO

Authors V. M. Tereshchenko

Publication date 20 January 2016

zbMATH Keywords

algorithmcomputational geometrycomputer graphicsconvex hullconvex layersGraham scanset of pointstriangulation

Mathematics Subject Classification ID

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

Recommendations

• An optimal parallel algorithm for triangulating a set of points in the plane
• Publication:3198929
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• A heuristic triangulation algorithm
• Delaunay triangulation and the convex hull of n points in expected linear time

Cited in

(7)

• A storage-efficient method for construction of a Thiessen triangulation
• scientific article; zbMATH DE number 4174383 (Why is no real title available?)
• Computing triangulations of the convex polygon in PHP/MySQL environment
• scientific article; zbMATH DE number 3913720 (Why is no real title available?)
• scientific article; zbMATH DE number 4028826 (Why is no real title available?)
• Method for finding and storing optimal triangulations based on square matrix
• Algorithms for triangulations

This page was built for publication: One method for triangulation a set of points in the plane

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