From digital plane segmentation to polyhedral representation
From MaRDI portal
(Redirected from From digital plane segmentation to polyhedral representation)
Recommendations
- Decomposition of a three-dimensional discrete object surface into discrete plane pieces
- Reversible polygonalization of a 3D planar discrete curve: Application on discrete surfaces
- Discrete polyhedrization of a lattice point set
- Recognition of digital naive planes and polyhedrization
- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
Cited in
(9)- Converting orthogonal polyhedra from extreme vertices model to B-Rep and to alternating sum of volumes
- Recognition of digital hyperplanes and level layers with forbidden points
- Determining the separation of preprocessed polyhedra -- A unified approach
- Complete Polygonal Scene Voxelization
- Discrete polyhedrization of a lattice point set
- Reversible polygonalization of a 3D planar discrete curve: Application on discrete surfaces
- Digital Planar Surface Segmentation Using Local Geometric Patterns
- Discrete surfaces segmentation into discrete planes
- On the construction of planar embedding for a class of orthogonal polyhedra
This page was built for publication: From digital plane segmentation to polyhedral representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419009)