论文信息 - A digital geometry for hexagonal pixels

A digital geometry for hexagonal pixels

Abstract Comparison of hexagonal and square pixels and arrays for image processing shows that the former have many advantages. However, squares can be addressed with integers and orthogonal axes, while for hexagons the axes must be at an oblique angle of 60°. This paper describes a general method of producing geometrical algorithms for such axes.

[1] Edward S. Deutsch. On Parallel Operations on Hexagonal Arrays , 1970, IEEE Transactions on Computers.

[2] R.M. Mersereau,et al. The processing of hexagonally sampled two-dimensional signals , 1979, Proceedings of the IEEE.

[3] Edward S. Deutsch,et al. Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[4] J. Allen Cox. Point-Source Location Using Hexagonal Detector Arrays , 1987 .

[5] Azriel Rosenfeld,et al. Connectivity in Digital Pictures , 1970, JACM.

[6] W. Massey. Singular homology theory , 1980 .

[7] Kendall Preston,et al. Feature Extraction by Golay Hexagonal Pattern Transforms , 1971, IEEE Transactions on Computers.

[8] Azriel Rosenfeld,et al. Distance on a Hexagonal Grid , 1976, IEEE Transactions on Computers.

[9] M. J. Jackson,et al. Spatially referenced methods of processing raster and vector data , 1983, Image Vis. Comput..

[10] L. Gibson,et al. Vectorization of raster images using hierarchical methods , 1982, Comput. Graph. Image Process..

[11] Marcel J. E. Golay,et al. Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[12] Bert Mendelson. Introduction to Topology , 1975 .

[13] Adrian Bowyer,et al. A Programmer's Geometry , 1983 .

[14] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.