Recognition of digital naive planes and polyhedrization
From MaRDI portal
(Redirected from Recognition of digital naive planes and polyhedrization)
Recommendations
- An elementary digital plane recognition algorithm
- (n,m)-cubes and Farey nets for naive planes understanding
- A fast and elementary algorithm for digital plane recognition
- Naive planes as discrete combinatorial surfaces
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
Cited in
(19)- A generalized preimage for the digital analytical hyperplane recognition
- 3D noisy discrete objects: Segmentation and application to smoothing
- Digitization scheme that assures faithful reconstruction of plane figures
- Geometric preservation of 2D digital objects under rigid motions
- On digital plane preimage structure
- An elementary digital plane recognition algorithm
- Recognition of affine-equivalent polyhedra by their natural developments
- scientific article; zbMATH DE number 4211554 (Why is no real title available?)
- A fast and elementary algorithm for digital plane recognition
- Digital plane preimage structure
- (n,m)-cubes and Farey nets for naive planes understanding
- From digital plane segmentation to polyhedral representation
- Naive planes as discrete combinatorial surfaces
- A simplified recognition algorithm of digital planes pieces
- Recognition of Blurred Pieces of Discrete Planes
- Gift-Wrapping Based Preimage Computation Algorithm
- Patterns for multigrid equidistributed functions: application to general parabolas and length estimation
- Gift-wrapping based preimage computation algorithm
- Digital planarity -- a review
This page was built for publication: Recognition of digital naive planes and polyhedrization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471804)