Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
From MaRDI portal
Publication:3003529
DOI10.1007/978-3-642-21073-0_14zbMath1330.68299OpenAlexW1888827390MaRDI QIDQ3003529
Émilie Charrier, Jacques-Olivier Lachaud
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_14
Related Items
An output-sensitive algorithm to compute the normal vector of a digital plane, Two plane-probing algorithms for the computation of the normal vector to a digital plane, An optimized framework for plane-probing algorithms, Shape Analysis with Geometric Primitives, An alternative definition for digital convexity, An alternative definition for digital convexity, Digital Plane Recognition with Fewer Probes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curvature estimation along noisy digital contours by approximate global optimization
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- 3D noisy discrete objects: Segmentation and application to smoothing
- Comparison and improvement of tangent estimators on digital curves
- Strong thinning and polyhedric approximation of the surface of a voxel object
- Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
- Discrete Geometry for Computer Imagery
- Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
