A fast and elementary algorithm for digital plane recognition

DOI10.1016/S1571-0653(04)00481-0zbMath1138.68595OpenAlexW2016888352MaRDI QIDQ3438911

No author found.

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00481-0

zbMATH Keywords

trianglechords setdigital naive plane

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (1)

A combinatorial technique for generation of digital plane using GCD

Cites Work

• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• Three-Dimensional Digital Planes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast and elementary algorithm for digital plane recognition