메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
San Hong (Soongsil University) Sangjun Park (Soongsil University) Chanil Kim (Soongsil University) Hyunjoo Song (Soongsil University)
저널정보
Korean Institute of Information Scientists and Engineers Journal of Computing Science and Engineering Journal of Computing Science and Engineering Vol.16 No.4
발행연도
2022.12
수록면
233 - 243 (11page)
DOI
10.5626/JCSE.2022.16.4.233

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
In this study, a novel orthogonal graph layout algorithm was proposed to efficiently represent the connection relationship between each node in power system data. The proposed layout algorithm is a four-stage algorithm. First, clustering was performed based on the connection relationship between nodes, and the obtained clusters were placed close to squares by using the squarified treemap technique to fully utilize the given space. Next, adjacent nodes were arranged in a snakelike order in each cluster according to the characteristics of the IEEE test system data. The links were then arranged according to the positional relationship of the pairs of connected nodes. Each node had several ports so that links could be distributed evenly according to the direction of the links. A case in which all nodes were arranged orthogonally in an arbitrary manner without performing clustering; a case in which adjacent nodes within each cluster were arranged in arbitrary order after only performing clustering; and a case where adjacent nodes within each cluster were arranged in row-major order after only performing clustering were compared. The results revealed that the proposed method considerably improved edge crossing, edge bending, and edge length.

목차

Abstract
I. INTRODUCTION
II. RELATED WORK
III. IEEE TEST CASE DATA
IV. GRAPH LAYOUT ALGORITHM
V. EVALUATION AND ANALYSIS OF THE LAYOUT RESULTS
VI. DISCUSSION
VII. CONCLUSION AND FUTURE WORK
REFERENCES

참고문헌 (22)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0