Storage and addressing scheme for practical hexagonal image processing

摘要

We present a practical hexagonal storage and addressing scheme, which eliminates the difference between theory and implementation in other addressing methods. This scheme employs a middleware-based address-mapping module that separates the algorithm and specific data addressing; thus any hexagonal algorithm can keep the native and consistent forms as in the coordinate system through theory and implementation. The scheme simplifies the implementation work and preserves all excellent features of the hexagonal lattice. Finally, we discuss the implementation issues and show that it's feasible and can be implemented efficiently.