Share Email Print

Proceedings Paper

Hexagonal domain transform for shape analysis
Author(s): Brian Carstens; Michael J. Quinn; Eugene Fichter
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Transformations play an important role in image processing. This paper describes an algorithm for transforming a discrete gray level image from square to hexagonal pixel representation. Pixels in a square grid have four closest neighbors, while those in a hexagonal grid have six. The algorithm is explained and then presented in the language Dataparallel C -- a portable high level language being developed at Oregon State University to express data parallel algorithms.

Paper Details

Date Published: 1 February 1992
PDF: 9 pages
Proc. SPIE 1607, Intelligent Robots and Computer Vision X: Algorithms and Techniques, (1 February 1992); doi: 10.1117/12.57057
Show Author Affiliations
Brian Carstens, Oregon State Univ. (United States)
Michael J. Quinn, Oregon State Univ. (United States)
Eugene Fichter, Oregon State Univ. (United States)

Published in SPIE Proceedings Vol. 1607:
Intelligent Robots and Computer Vision X: Algorithms and Techniques
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?