A simple algorithm for digital line recognition in the general case

DOI10.1016/J.PATCOG.2006.10.005zbMATH Open1111.68108OpenAlexW1980454437MaRDI QIDQ877107FDOQ877107

Authors: Lilian Buzer 

Publication date: 19 April 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.10.005

Recommendations

• Discrete Geometry for Computer Imagery
• scientific article; zbMATH DE number 2087479
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• scientific article; zbMATH DE number 4057076
• The linear time recognition of digital arcs

zbMATH Keywords

convex hullimplementationthicknessdigital lineincremental recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the width of a set
• On-line construction of the convex hull of a simple polyline
• A linear incremental algorithm for naive and standard digital lines and planes recognition

Cited In (8)

• An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• Translation of a Digital Line into another according to various Digitization Processes
• Title not available (Why is that?)
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• Integral invariants for space motion trajectory matching and recognition
• Title not available (Why is that?)
• Discrete Geometry for Computer Imagery

This page was built for publication: A simple algorithm for digital line recognition in the general case

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