scientific article; zbMATH DE number 4211509

MaRDI QIDQ3358237zbMATH OpenFDO

Authors A. W. M. Smeulders, Leo Dorst

Publication date 1991

zbMATH Keywords

characterizationdigital geometrycodingdigital polygonsstraight linedigital straightness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Line segmentation of digital curves in parallel
• Discrete Geometry for Computer Imagery
• Fast Polynomial Segmentation of Digitized Curves
• What does digital straightness tell about digital convexity?
• scientific article; zbMATH DE number 4057076

Cited in

(15)

• An output-sensitive algorithm to compute the normal vector of a digital plane
• An optimal parallel algorithm for digital curve segmentation
• On the min DSS problem of closed discrete curves
• Canonical representations of discrete curves
• Digital straightness, circularity, and their applications to image analysis
• Maximal planes and multiscale tangential cover of 3D digital objects
• Digital straightness -- a review
• Generation of random digital simple curves with artistic emulation
• Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
• Discrete Geometry for Computer Imagery
• The number of Khalimsky-continuous functions between two points
• Digital straightness
• Multi-primitive analysis of digital curves
• Dynamic minimum length polygon
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search

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