A fast and elementary algorithm for digital plane recognition

DOI10.1016/S1571-0653(04)00481-0MaRDI QIDQ3438911zbMATH OpenOpenAlexFDO

Authors

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

chords setdigital naive planetriangle

Mathematics Subject Classification ID

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

Recommendations

• An elementary digital plane recognition algorithm
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• Three-Dimensional Digital Planes
• Two plane-probing algorithms for the computation of the normal vector to a digital plane

Cites work

• A question of digital linear algebra
• An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• Recognition of digital naive planes and polyhedrization
• Three-Dimensional Digital Planes

Cited in

(18)

• Digitization scheme that assures faithful reconstruction of plane figures
• An elementary digital plane recognition algorithm
• Thoughts on 3D digital subplane recognition and minimum-maximum of a bilinear congruence sequence
• An efficient algorithm to compute subsets of points in Z^n
• Recognition of digital hyperplanes and level layers with forbidden points
• Three-Dimensional Digital Planes
• (n,m)-cubes and Farey nets for naive planes understanding
• Coexistence of tricubes in digital naive plane
• A question of digital linear algebra
• Naive planes as discrete combinatorial surfaces
• Recognition of digital naive planes and polyhedrization
• A simplified recognition algorithm of digital planes pieces
• Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• A combinatorial technique for generation of digital plane using GCD
• Recognizing arithmetic straight lines and planes
• Digital planarity -- a review

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

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