scientific article; zbMATH DE number 3848644

zbMATH Open0534.68065MaRDI QIDQ3318142FDOQ3318142

Authors: Albrecht Hübler, Reinhard Klette, Klaus Voss 

Publication date: 1981

Title of this publication is not available (Why is that?)

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

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)

Cited In (14)

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

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)