Digital distance functions on three-dimensional grids
From MaRDI portal
(Redirected from Publication:630601)
Recommendations
- Neighborhood sequences in the diamond grid -- algorithms with four neighbors
- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms
- Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids
- Distances based on neighbourhood sequences in non-standard three-dimensional grids
- Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids
Cites work
- scientific article; zbMATH DE number 1691495 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 2099143 (Why is no real title available?)
- Approximating the Euclidean circle in the square grid using neighbourhood sequences
- Approximating the Euclidean distance using non-periodic neighbourhood sequences
- Best simple octagonal distances in digital geometry
- Cannonballs and honeycombs.
- Chamfer metrics in mathematical morphology
- Digital Distance Transforms in 3D Images Using Information from Neighbourhoods up to 5×5×5
- Discrete Geometry for Computer Imagery
- Distance functions defined by variable neighbourhood sequences
- Distance functions in digital geometry
- Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\)
- Distances based on neighbourhood sequences in non-standard three-dimensional grids
- Distances defined by neighborhood sequences
- General neighborhood sequences in \(\mathbb Z^n\)
- Geometry of digital spaces
- Investigation of medical 3D-rendering algorithms
- Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D
- Neighborhood sequences in the diamond grid -- algorithms with four neighbors
- Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids
- Non-traditional grids embedded in \(\mathbb Z^{n}\)
- Octagonal distances for digital pictures
- Sequential Operations in Digital Picture Processing
- Visible vectors and discrete Euclidean medial axis
- Weighted distance transforms generalized to modules and their computation on point lattices
- Weighted distances based on neighborhood sequences for point-lattices
Cited in
(19)- Rhombic dodecahedron grid-coordinate system and 3D digital object definitions
- Digitized rotations of closest neighborhood on the triangular grid
- Body centered cubic grid -- coordinate system and discrete analytical plane definition
- Neighborhood sequences in the diamond grid -- algorithms with four neighbors
- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms
- Surface-based computation of the Euler characteristic in the BCC grid
- Wiener index on lines of unit cells of the body-centered cubic grid
- Hyperspheres in digital geometry
- Distance-driven curve-thinning on the face-centered cubic grid
- Almost regular metrics on groups and Lipschitz-continuity of distance transforms
- A combinatorial 4-coordinate system for the diamond grid
- Distance transform computation for digital distance functions
- Digital objects in rhombic dodecahedron grid
- Repairing 3D binary images using the FCC grid
- Geometric and cognitive differences between logical diagrams for the Boolean algebra \(\mathbb {B}_{4}\)
- Distance functions based on multiple types of weighted steps combined with neighborhood sequences
- Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
- Generalised distances of sequences. II: \(B\)-distances with weight sequences
- Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands
This page was built for publication: Digital distance functions on three-dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630601)