A Connection between Z n and Generalized Triangular Grids
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Neighborhood Sequences in the Diamond Grid --- Algorithms with Four Neighbors
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Parallel Contextual Hexagonal Array Grammars and Languages
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Parallel edge detection on a virtual hexagonal structure
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Isoperimetrically optimal polygons in the triangular grid
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Bilateral edge detection on a virtual hexagonal structure
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Supercover of non-square and non-cubic grids
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
| Hi-index | 0.01 |
The hexagonal grid has long been known to be superior to the more traditional rectangular grid system in many aspects in image processing and machine vision related fields. However, systematic developments of the mathematical backgrounds for the hexagonal grid are conspicuously lacking. The purpose of this paper is to study geometric transformations on the hexagonal grid. Formulations of the transformation matrices are carried out in a symmetrical hexagonal coordinate frame. A trio of new trigonometric functions are defined in this paper to facilitate the rotation transformations. A fast algorithm for rounding an arbitrary point to the nearest hexagonal grid point is also presented