A digital geometry for hexagonal pixels

https://doi.org/10.1016/0262-8856(89)90044-9Get rights and content

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.

References (17)

  • L Gibson et al.

    Vectorisation of raster images using hierarchical methods

    Comput. Graphics and Image Process

    (1982)
  • SBM Bell et al.

    Spatially referenced methods of processing raster and vector data

    mage Vision Comput.

    (1983)
  • MJE Golay

    Hexagonal parallel pattern transformations

    IEEE Trans. Comput.

    (August 1969)
  • K Preston

    Features extraction by Golay hexagonal pattern transformations

    IEEE Trans. Comput.

    (September 1971)
  • SBM Bell et al.

    The HoR quadtree: an optimal structure based on a non-square 4-shape

  • A Rosenfeld

    Digital topology

    Am. Math. Monthly

    (1979)
  • A Rosenfeld

    Connectivity in digital pictures

    J. ACM

    (January 1970)
  • ES Deutsch

    On parallel operations on hexagonal arrays

    IEEE Trans. Comput.

    (October 1970)
There are more references available in the full text version of this article.

Cited by (0)

View full text