Recognition of digital hyperplanes and level layers with forbidden points
From MaRDI portal
Publication:3003530
DOI10.1007/978-3-642-21073-0_15zbMATH Open1330.68312OpenAlexW2166803515MaRDI QIDQ3003530FDOQ3003530
Authors: L. Provot, Yan Gerard 
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_15
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
- 3D noisy discrete objects: Segmentation and application to smoothing
- An elementary digital plane recognition algorithm
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- Digital planarity -- a review
- Linear Programming in Linear Time When the Dimension Is Fixed
- An elementary algorithm for digital arc segmentation
- Introduction to digital level layers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Introduction to digital level layers
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- Separability and Tight Enclosure of Point Sets
- Fitting discrete polynomial curve and surface to noisy data
- A generalized preimage for the digital analytical hyperplane recognition
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
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)
