8k-ary Grid graph models of tabular forms

作     者：Yaku, Takeo Anada, Koichi Anzai, Koushi Koka, Shinji Miyadera, Youzou Tsuchida, Kensei 

作者机构：Dept. Information Science Nihon University Tokyo Japan Waseda Research Institute for Science and Engineering Waseda University Tokyo Japan Dept. Economics Kanto Gakuen University Gunma Japan College of Humanities and Sciences Nihon University Tokyo Japan Div. Natural Science Tokyo Gakugei University Tokyo Japan Dept. Information Sciences and Arts Toyo University Kawagoe Japan 

出 版 物：《Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)》 (Lect. Notes Comput. Sci.)

年 卷 期：2014年第8373卷

页      面：465-477页

核心收录：

主　　题：Graph theory 

摘      要：Tabular forms are commonly used in software. Those tabular forms are represented as rectangular dissections. In rectangular dissections, ruled line oriented operations such as cell merge, line and column operations are often used. With respect to ruled line oriented operations, 8k-ary grid graphs have been introduced as models of rectangular dissections that provide fast algorithms. This paper surveys octal and hexa-decimal grid graph models of rectangular dissections. First, octal grids, called octgrids, for single layer rectangular dissections and related algorithms are introduced. Next, hexa-decimal grid graphs for multiple layer rectangular dissections, called hexadeci-grids, and related algorithms are introduced. Furthermore, tetraicosa-grid graphs for rectangular solid dissections for CG applications, called tetraicosa-grids and related algorithms are introduced. © 2014 Springer-Verlag Berlin Heidelberg.