Introduction to digital level layers
From MaRDI portal
Publication:3000688
DOI10.1007/978-3-642-19867-0_7zbMATH Open1272.68432OpenAlexW1598227304MaRDI QIDQ3000688FDOQ3000688
Authors: Yan Gerard, L. Provot, Fabien Feschet
Publication date: 19 May 2011
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19867-0_7
Recommendations
Linear programming (90C05) Computing methodologies for image processing (68U10) Computational aspects related to convexity (52B55)
Cited In (7)
- Geometric preservation of 2D digital objects under rigid motions
- Recognition of digital hyperplanes and level layers with forbidden points
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
- On connectivity of discretized 2D explicit curve
- Separability and Tight Enclosure of Point Sets
- Fitting discrete polynomial curve and surface to noisy data
- On properties of analytical approximation for discretizing 2D curves and 3D surfaces
This page was built for publication: Introduction to digital level layers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000688)