scientific article; zbMATH DE number 5697797

MaRDI QIDQ3553169zbMATH OpenFDO

Authors V. M. Tereshehenko, O. V. Tereshchenko

Publication date 22 April 2010

zbMATH Keywords

convex hulldivide and conquerefficiency of algorithminvolution giftpolytopesimplex

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Combinatorial Image Analysis
• Rectilinear convex hull of points in 3D
• Three-dimensional convex hull as a fruitful source of diagrams
• Topology-oriented construction of three-dimensional convex hulls
• Construction of 3D orthogonal convex hull of a digital object
• A structural property of convex 3-polytopes
• Construction of the convex hull of a finite set of points using triangulation
• On convex hulls

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 Q3553169)