Digital straight segment filter for geometric description

DOI10.1007/978-3-030-76657-3_18MaRDI QIDQ2061807zbMATH OpenOpenAlexFDO

Authors Rémi Decelle, Phuc Ngo, Isabelle Debled-Rennesson, Frédéric Mothe, Fleur Longuetaud

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-76657-3_18

zbMATH Keywords

digital straight segmentdirectional filterFarey sequencesorientation fieldStern-Brocot treethickness

Mathematics Subject Classification ID

Farey sequences; the sequences (1^k, 2^k, dots) (11B57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 4016245
• scientific article; zbMATH DE number 4057076
• Digital geometry in image processing
• Digitalizing line segments
• Representation of digital line segments and their preimages
• Delaunay properties of digital straight segments
• An elementary algorithm for digital arc segmentation
• An elementary algorithm for digital arc segmentation
• Revisiting Digital Straight Segment Recognition

Cites work

• Dominant point detection based on discrete curve structure and applications
• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 1436417 (Why is no real title available?)
• On the number of digital straight line segments
• The number of digital straight lines on an N*N grid
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour

This page was built for publication: Digital straight segment filter for geometric description

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061807)