Three-Dimensional Digital Planes
From MaRDI portal
Publication:3219152
DOI10.1109/TPAMI.1984.4767578zbMath0555.68063WikidataQ39996132 ScholiaQ39996132MaRDI QIDQ3219152
Publication date: 1984
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
image processingdigital geometrydigital planedigital convexitydigital surfacechordal triangle property
Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)
Related Items (15)
Digital planarity -- a review ⋮ A note on the approximation of linear and affine functions: The case of bounded slope ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Patterns for multigrid equidistributed functions: application to general parabolas and length estimation ⋮ The supercover of an \(m\)-flat is a discrete analytical object ⋮ Continuous digitization in Khalimsky spaces ⋮ Separability and Tight Enclosure of Point Sets ⋮ 3D image synthesis for B-reps objects ⋮ On digital plane preimage structure ⋮ An elementary digital plane recognition algorithm ⋮ Criteria for approximation of linear and affine functions ⋮ A fast and elementary algorithm for digital plane recognition ⋮ Digital plane preimage structure ⋮ On the flatness of digital hyperplanes
This page was built for publication: Three-Dimensional Digital Planes
