article · 2013

Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion

Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi

Cited by 0Abstract and details only

Abstract

In this paper, we consider 2.5D drawing of a pair of trees which are connected by some edges, representing relationships between nodes, as an attempt to develop a tool for analyzing pairwise hierarchical data. We consider two ways of drawing such a graph, called parallel and perpendicular drawings, where the graph appears as a bipartite graph viewed from two orthogonal angles X and Y. We define the occlusion of a drawing as the sum of the edge crossings that can be seen in the two angles, and propose algorithms to minimize the occlusion based on the fundamental one-sided crossing minimization problem. We also give some visualization examples of our method using phylogenetic trees and a mushroom database. 1

Cite this paper

APA 7

Haraguchi, K., Hong, S.-H., & Nagamochi, H. (2013). Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion.

MLA 9

Haraguchi, Kazuya, et al. “Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion.” 2013.

Chicago

Haraguchi, Kazuya, Seok-Hee Hong, and Hiroshi Nagamochi. 2013. “Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion.”

Harvard

Haraguchi, K., Hong, S.-H. and Nagamochi, H. (2013) ‘Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion’.

BibTeX

@article{haraguchi2013visual,
  title = {{Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion}},
  author = {Haraguchi, Kazuya and Hong, Seok-Hee and Nagamochi, Hiroshi},
  year = {2013}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.