The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
스프링 임베더를 사용하여 그린 네트워크 다이어그램은 읽기가 쉽지 않기 때문에 본 논문에서는 일부 노드를 앵커로 고정하는 "앵커드 맵"의 사용을 제안합니다. 네트워크 다이어그램의 가독성에 대해 논의하고 고정 맵을 제안하며 고정 맵을 그리는 방법을 설명합니다. 이 방법은 인덱스를 사용하여 앵커의 순서를 결정합니다. 왜냐하면 이러한 순서는 네트워크 다이어그램의 가독성에 현저한 영향을 미치기 때문입니다. 고정된 지도의 효율성을 보여주는 예도 나와 있습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kazuo MISUE, "Anchored Map: Graph Drawing Technique to Support Network Mining" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 11, pp. 2599-2606, November 2008, doi: 10.1093/ietisy/e91-d.11.2599.
Abstract: Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.11.2599/_p
부
@ARTICLE{e91-d_11_2599,
author={Kazuo MISUE, },
journal={IEICE TRANSACTIONS on Information},
title={Anchored Map: Graph Drawing Technique to Support Network Mining},
year={2008},
volume={E91-D},
number={11},
pages={2599-2606},
abstract={Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.},
keywords={},
doi={10.1093/ietisy/e91-d.11.2599},
ISSN={1745-1361},
month={November},}
부
TY - JOUR
TI - Anchored Map: Graph Drawing Technique to Support Network Mining
T2 - IEICE TRANSACTIONS on Information
SP - 2599
EP - 2606
AU - Kazuo MISUE
PY - 2008
DO - 10.1093/ietisy/e91-d.11.2599
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2008
AB - Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.
ER -