Subdivision and homogenization of cells in heterogeneous rectangular dissections by an octal grid graph model

Rectangular dissections are commonly used for tabular forms such as spreadsheets, raster data in computer graphics, and so forth and we need processing for cells of data represented by rectangular dissections. In this paper, we deal with data structures and algorithms for rectangular dissections or raster data with heterogeneous parts. In particular, we would like to introduce an algorithm to subdivide and homogenize rectangular dissections with heterogeneous parts represented by octgrids.

[1]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[2]  Takeo Yaku,et al.  The Number of Cells in Regions Shifted on 2D Images Represented by Raster Data with Heterogeneous Parts , 2013, 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[3]  Takeo Yaku,et al.  Reduction of resolution for binary images by an octal grid graph representation model , 2013, 2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS).

[4]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[5]  Youzou Miyadera,et al.  8k-ary Grid Graph Models of Tabular Forms , 2014, Specification, Algebra, and Software.

[6]  Takeo Yaku,et al.  A rotation algorithm for multiple layer images by a hexadecimal grid graph model , 2016, 2016 IEEE International Conference on Industrial Technology (ICIT).