Presentation 1996/6/15
An Illustrative Mapping Algorithm for Drawing a Directed Graph : A Illustrative Mapping Method
Kazumasa ISHIZAKA, Hitoshi SASAKI, Makoto TAKEYA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A directed graph has been utilized in many domains. It is difficult to draw the directed graph from an "illustrative" view point. This paper presents all Illustrative Mapping method, called an IM Method as shortly. The IM method is formulated by an algorithm based on the criterion of item importance, which was defined as measure of signification of each item on the graph in our previous paper. In this paper the IM method is compared with the traditional methods: both the centroid method and the gradual calculation one, according to the arrow cross number, the number, of sum of arrow length and uniformity measure. As a result, this paper discussed effectiveness of the IM method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) directed graph / cognitive map / visible criterion / illustrative mapping algorithm
Paper # ET96-26
Date of Issue

Conference Information
Committee ET
Conference Date 1996/6/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Educational Technology (ET)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Illustrative Mapping Algorithm for Drawing a Directed Graph : A Illustrative Mapping Method
Sub Title (in English)
Keyword(1) directed graph
Keyword(2) cognitive map
Keyword(3) visible criterion
Keyword(4) illustrative mapping algorithm
1st Author's Name Kazumasa ISHIZAKA
1st Author's Affiliation NHK Computer Service Co., Ltd.()
2nd Author's Name Hitoshi SASAKI
2nd Author's Affiliation Faculty of Engineering, Takushoku University
3rd Author's Name Makoto TAKEYA
3rd Author's Affiliation Faculty of Engineering, Takushoku University
Date 1996/6/15
Paper # ET96-26
Volume (vol) vol.96
Number (no) 96
Page pp.pp.-
#Pages 8
Date of Issue