Triangulation of scattered data in 3D space

From MaRDI portal





Suppose a set of points is read off from a surface, a torus, say. The problem is to find a triangulation of those points that in some sense produces optimally shaped triangles. This paper presents a detailed algorithm for the triangulation task and also proposes a criterion to determine ``optimally shaped triangles, i.e., triangles such that the polyhedron formed by them is as smooth as possible.




Cited in
(29)








This page was built for publication: Triangulation of scattered data in 3D space

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