A simple algorithm for digital line recognition in the general case

DOI10.1016/j.patcog.2006.10.005zbMath1111.68108OpenAlexW1980454437MaRDI QIDQ877107

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

zbMATH Keywords

thicknessconvex hullimplementationdigital lineincremental recognition

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On-line construction of the convex hull of a simple polyline
• Computing the width of a set
• A linear incremental algorithm for naive and standard digital lines and planes recognition

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