scientific article; zbMATH DE number 3848644

MaRDI QIDQ3318142zbMATH OpenFDO

Authors Albrecht Hübler, Reinhard Klette, Klaus Voss

Publication date 1981

zbMATH Keywords

algorithmconvex hulldigital image processingconvexity of digital objects

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Finding the convex hull of a simple polygon
• An efficient and numerically correct algorithm for the 2D convex hull problem
• A 1 log N parallel algorithm for detecting convex hulls on image boards
• The Ultimate Planar Convex Hull Algorithm?
• Finding the convex hull of a simple polygon in linear time

Cited in

(14)

• Lyndon + Christoffel = digitally convex
• Digital straightness -- a review
• scientific article; zbMATH DE number 6846375 (Why is no real title available?)
• An alternative definition for digital convexity
• An alternative definition for digital convexity
• An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
• An algorithm to find the lineality space of the positive hull of a set of vectors
• Construction of some computational algorithms on finite sets of points in the plane
• Detection of the discrete convexity of polyominoes
• Efficient lattice width computation in arbitrary dimension
• scientific article; zbMATH DE number 1822514 (Why is no real title available?)
• Computing efficiently the lattice width in any dimension
• An efficient convex hull algorithm using affine transformation in planar point set
• Digital straightness

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