Learn More
Spreadsheets are frequently used in information processing. In those information processing, automatic generation and automatic verification of spreadsheets are required. However, it is difficult to verify the structure of spread sheets with flexible calculation ranges and with heterogeneous structures. Accordingly, the modeling of spreadsheets is(More)
We deal with a formalization of financial statements. In order to formalize financial statements, we have to specify the spatial order of items, and specify calculation methods. In this paper, we construct a context sensitive graph grammar to specify the order of items of financial statement. Furthermore we also append attribute rules to the(More)
Rectangular and rectangular piped dissections are commonly used as structures in information processing. Among them are tabular forms in document processing, tables in spread sheet processing, land forms in GIS and raster data in CG. We note that such transformation often include ruled line preserving transformations. This paper deals with graph modeling of(More)
Heterogeneous rectangular dissections are frequently used in information processing such as multiple paged books in spread sheet languages and multiple layered image data. In previous studies, a hexadecimal grid graph model was proposed for multiple layered rectangular dissections and certain algorithms were provided. In this paper, we propose a 32-ary list(More)
This paper deals with a data structure that models time-continous 4D objects. We propose a 64-degree grid graphs by dimension hightening of tetraicosa-grids. Algorithm used for resolution reduction is also introduced. Fortheremore, 64-degree grid is compared to 16-ary trees with respect to effectiveness and efficiency.
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(More)