大規模分枝限定木可視化のための適応的木構造グラフ生成  [in Japanese] Adaptive Tree Visualization for a Large Branch-and-Bound Tree  [in Japanese]

Search this Article

Author(s)

Abstract

大規模な階層データを,限られた空間内へ効率的に表現する適応的表示法を提案する.階層データは属性値をもつノードと親子関係を表わすリンクから構成されており,それぞれをプリミティブで表すことで構造を視覚的に捉えられる.しかし,大規模階層データを表示する際に,隣り合うノードやリンクが重なり合ってしまう問題がある.そこで本論文では,大規模階層データを木構造で表す際に,ノードの密集具合に応じて木の表現方法を選択する適応的表示を提案する.さらに,本提案手法を大規模分枝限定木に適用し,その効果を検証する.

We propose an adaptive visualization technique for a large-scale hierarchical dataset within limited display space. A hierarchical dataset has nodes and links that represent the parents/child relationship. 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 many primitives are overlapped within a limited region. In this context, we propose an adaptive visualization technique for hierarchical datasets. The proposed technique selects an appropriate graph style based on the density of the nodes. In addition, we demonstrate the effectiveness of the proposed method by applying it to the growing process of a large branch-and-bound tree.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 63, 45-48, 2007-03-03

    Information Processing Society of Japan (IPSJ)

References:  8

Codes

  • NII Article ID (NAID)
    110006248719
  • NII NACSIS-CAT ID (NCID)
    AN10505667
  • Text Lang
    JPN
  • Article Type
    ART
  • ISSN
    09196072
  • NDL Article ID
    8706364
  • NDL Call No.
    Z14-1121
  • Data Source
    CJP  NDL  NII-ELS 
Page Top