A multi-layer rectangular dissections and the list structures for the 16-ary grid graph
Koichi Anada, Koushi Anzai, Ken Yokota, Takeo Yaku · 2016
Heterogeneous rectangular dissections are frequently used in information processing such as multiple paged books in spread sheet languages and multi-layer image data. In previous studies, a hexadecimal grid graph model was proposed for multilayer rectangular dissections and certain algorithms were provided. In this paper, we propose a 16-ary list structure to implement their algorithms for the hexadecimal grid graph model. The list structure has limited number of fields in a record, so the computation time is low. Furthermore, it has one record for each node in the given hexadecimal grid, and 48 fields for each record. We also show a data format of the whole structure of the list.