Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Miyamura, Hiroko; Ozahata, Satoshi*; Shinano, Yuji*; Miyashiro, Ryuhei*
Proceedings of 8th International Joint Conference on Computer Science and Software Engineering (JCSSE-2011), p.187 - 192, 2011/00
This paper proposes an adaptive visualization technique for representing a large-scale hierarchical dataset within a limited display space. A hierarchical dataset has nodes and links that reveal the parent-child relationship between the nodes. These nodes and links are described using graphics primitives. When the number of these primitives is large, it is difficult to recognize the structure of the hierarchical data because several primitives overlap within a display space. In order To overcome this difficulty, we propose an adaptive visualization technique for hierarchical datasets. The proposed technique selects an appropriate graph style according to the nodal density in each area.
Miyamura, Hiroko; Shinano, Yuji*; Miyashiro, Ryuhei*; Saito, Takafumi*
Joho Shori Gakkai Rombunshi; Suri Moderuka To Oyo (Internet), 2(2), p.103 - 112, 2009/03
In branch-and-bound algorithms for integer programming, runtime behavior of the algorithms depends much on branching strategy. However, from a huge computation log of a large program, it is difficult to explore a key factor for effective branching. To analyze which factor of branching strategy is essential, we develop a system for visualization of growing process of a large branch-and-bound tree. The proposed system provides intuitive understanding how branching strategy affects branch-and-bound process.
