A generalized preimage for the digital analytical hyperplane recognition
From MaRDI portal
Recommendations
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Recognition of digital hyperplanes and level layers with forbidden points
- Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
- An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem
Cites work
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- An elementary digital plane recognition algorithm
- Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
- Digital planarity -- a review
- Digital straightness -- a review
- Discrete linear objects in dimension n: the standard model
- Discrete Representation of Straight Lines
- scientific article; zbMATH DE number 4211554 (Why is no real title available?)
- On digital plane preimage structure
- Recognition of digital naive planes and polyhedrization
Cited in
(8)- On digital plane preimage structure
- Recognition of digital hyperplanes and level layers with forbidden points
- Fitting discrete polynomial curve and surface to noisy data
- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
- Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions
- Gift-Wrapping Based Preimage Computation Algorithm
- Generation and recognition of digital planes using multi-dimensional continued fractions
- Gift-wrapping based preimage computation algorithm
This page was built for publication: A generalized preimage for the digital analytical hyperplane recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003708)