Recognition of digital hyperplanes and level layers with forbidden points
From MaRDI portal
Publication:3003530
Recommendations
- A generalized preimage for the digital analytical hyperplane recognition
- An elementary digital plane recognition algorithm
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- scientific article; zbMATH DE number 4211554
- A fast and elementary algorithm for digital plane recognition
Cites work
- scientific article; zbMATH DE number 1958118 (Why is no real title available?)
- scientific article; zbMATH DE number 2087479 (Why is no real title available?)
- 3D noisy discrete objects: Segmentation and application to smoothing
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- An elementary algorithm for digital arc segmentation
- An elementary digital plane recognition algorithm
- Digital planarity -- a review
- Introduction to digital level layers
- Linear Programming in Linear Time When the Dimension Is Fixed
Cited in
(6)- Introduction to digital level layers
- A generalized preimage for the digital analytical hyperplane recognition
- Separability and Tight Enclosure of Point Sets
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- Fitting discrete polynomial curve and surface to noisy data
This page was built for publication: Recognition of digital hyperplanes and level layers with forbidden points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003530)
