Abstract
We present a practical hexagonal storage and addressing scheme, which eliminates the difference between theory and imple- mentation in other addressing methods. This scheme employs a mid- dleware-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 implementa- tion work and preserves all excellent features of the hexagonal lattice. Finally, we discuss the implementation issues and show that it's fea- sible and can be implemented efficiently.© 2013 SPIE and IS&T (DOI:
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
