著者

伊庭 健二 川崎 龍子 熊野 長次郎

出版者

一般社団法人 電気学会

雑誌

電気学会論文誌C(電子・情報・システム部門誌) (ISSN:03854221)

巻号頁・発行日

vol.114, no.2, pp.252-258, 1994-02-20 (Released:2008-12-19)

参考文献数

5

---

This paper presents a method for drawing power system networks using fractal technique. It is quite common to represent power systems as visual network graph. The drawing of such graph, however, was performed manually by human-hand. Automatic drawing makes possible to represent power system flexibly. The mathematical problem seems to be similar to “How to draw planar graph”. However, unlike to the planar graph problem which treats eassentially non-separable, power systems contain a few loops. Fractal graph is utilized in this paper. Our problem is defined as follows: (1) All vertex must be on the grid. All branches must be composed of horizontal or vertical line segments. The vertex that has more than 5 degree can be divided into sub-vertices. (2) Geometrical relationship between two vertices must be preserved as long as possible (In this paper, “Geometrical” means “Directional”). (3) Branches should not cross each other as long as possible. The method is applied to some practical power system networks. Although the method has some week points for grid systems, the test results show the feasibility of the proposed method.