scientific article; zbMATH DE number 4211509

zbMATH Open0732.68057MaRDI QIDQ3358237FDOQ3358237

Authors: A. W. M. Smeulders, Leo Dorst 

Publication date: 1991

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

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

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)

Cited In (15)

• On the min DSS problem of closed discrete curves
• An output-sensitive algorithm to compute the normal vector of a digital plane
• An optimal parallel algorithm for digital curve segmentation
• Digital straightness, circularity, and their applications to image analysis
• Canonical representations of discrete curves
• 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
• Digital straightness
• The number of Khalimsky-continuous functions between two points
• 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)