Geometry of Neighborhood Sequences in Hexagonal Grid

DOI10.1007/11907350_5MaRDI QIDQ5386009zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 17 April 2008

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11907350_5

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
• Combinatorial Image Analysis
• scientific article; zbMATH DE number 1992654
• Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids
• Digital distances on the triangular grid

Cited in

(10)

• Isoperimetrically optimal polygons in the triangular grid
• Approximating the Euclidean circle in the square grid using neighbourhood sequences
• Boundary detection in a hexagonal grid using energy minimization
• Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
• Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences
• Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
• Application of neighborhood sequences in communication of hexagonal networks
• Combinatorial Image Analysis
• Non-traditional 2D grids in combinatorial imaging -- advances and challenges
• Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid

This page was built for publication: Geometry of Neighborhood Sequences in Hexagonal Grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386009)