Three-Dimensional Digital Planes
From MaRDI portal
Recommendations
Cited in
(27)- Criteria for approximation of linear and affine functions
- A note on the approximation of linear and affine functions: The case of bounded slope
- On the flatness of digital hyperplanes
- Covering a Euclidean line or hyperplane by dilations of its discretization
- Continuous digitization in Khalimsky spaces
- On digital plane preimage structure
- An elementary digital plane recognition algorithm
- Thoughts on 3D digital subplane recognition and minimum-maximum of a bilinear congruence sequence
- Introduction to digital level layers
- Maximal planes and multiscale tangential cover of 3D digital objects
- A fast and elementary algorithm for digital plane recognition
- Digital plane preimage structure
- Digital surfaces
- scientific article; zbMATH DE number 2079731 (Why is no real title available?)
- scientific article; zbMATH DE number 1531867 (Why is no real title available?)
- Separability and Tight Enclosure of Point Sets
- scientific article; zbMATH DE number 2087482 (Why is no real title available?)
- scientific article; zbMATH DE number 1848292 (Why is no real title available?)
- scientific article; zbMATH DE number 1438574 (Why is no real title available?)
- Generation of digital planes using generalized continued-fractions algorithms
- A combinatorial technique for generation of digital plane using GCD
- Full convexity for polyhedral models in digital spaces
- Patterns for multigrid equidistributed functions: application to general parabolas and length estimation
- 3D image synthesis for B-reps objects
- Digital planarity -- a review
- Boundaries in digital planes
- The supercover of an \(m\)-flat is a discrete analytical object
This page was built for publication: Three-Dimensional Digital Planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219152)
