Digital distances on the triangular grid
From MaRDI portal
Recommendations
Cited in
(15)- The t-cost distance in digital geometry
- Weighted distances on the trihexagonal grid
- An integer programming approach to characterize digital disks on the triangular grid
- Digital geometry on the dual of some semi-regular tessellations
- On disks of the triangular grid: an application of optimization theory in discrete geometry
- Digitized rotations of 12 neighbors on the triangular grid
- Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands
- Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
- Neighborhood sequences in the diamond grid -- algorithms with four neighbors
- scientific article; zbMATH DE number 1992654 (Why is no real title available?)
- On the chamfer polygons on the triangular grid
- Weighted Distances on a Triangular Grid
- Geometry of Neighborhood Sequences in Hexagonal Grid
- Digital disks by weighted distances in the triangular grid
- Digitized rotations of closest neighborhood on the triangular grid
This page was built for publication: Digital distances on the triangular grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065336)