Maximal planes and multiscale tangential cover of 3D digital objects
From MaRDI portal
Recommendations
Cites work
- 3D noisy discrete objects: Segmentation and application to smoothing
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- Comparison and improvement of tangent estimators on digital curves
- Curvature estimation along noisy digital contours by approximate global optimization
- Discrete Geometry for Computer Imagery
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 4211509 (Why is no real title available?)
- scientific article; zbMATH DE number 1744996 (Why is no real title available?)
- Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- Multi-scale analysis of discrete contours for unsupervised noise detection
- Strong thinning and polyhedric approximation of the surface of a voxel object
Cited in
(9)- An optimized framework for plane-probing algorithms
- Two plane-probing algorithms for the computation of the normal vector to a digital plane
- An output-sensitive algorithm to compute the normal vector of a digital plane
- Multiscale discrete geometry
- Shape analysis with geometric primitives
- Digital plane recognition with fewer probes
- An alternative definition for digital convexity
- An alternative definition for digital convexity
- Tangential cover for thick digital curves
This page was built for publication: Maximal planes and multiscale tangential cover of 3D digital objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003529)
