A heuristic algorithm for drawing of a flow diagram

被引:4
作者
Grekas, DN [1 ]
Frangopoulos, CA [1 ]
机构
[1] Natl Tech Univ Athens, Dept Naval Architecture & Marine Engn, Zografos 15773, Greece
关键词
intelligent CAD; heuristics; graph-models; flow diagram; engineering systems;
D O I
10.1016/S0965-9978(00)00086-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A flow diagram is a graphical presentation of an energy or chemical system with its components and their interconnections through mass and energy streams. An automatic drawing algorithm of how diagrams has been developed and presented in this article. It heuristically imitates all the procedures carried out by a designer, starting with his conceptual understanding of the system's topological structure and finishing with graphically representing the system on the paper or screen. The topological structure of the system is given as input in the form of digraph. As a first step, it is transformed to a planar digraph by introducing new vertices representing crossings between the various streams. The near-optimum (smallest) number of crossings is determined heuristically. Then the flow diagram is drawn on the screen using special mechanical engineering symbols for the components of the system. Horizontal and vertical lines represent streams of mass or energy, identified by different colors. Unnecessary expansion of the drawing area is avoided by the application of linear and integer-linear programming algorithms. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:239 / 253
页数:15
相关论文
共 14 条
  • [1] [Anonymous], PRINCIPLES ARTIFICIA
  • [2] BALAKRISHNAN VK, 1997, SHAUMS OUTLINE SERIE
  • [3] BALAKRISHNAN VK, 1991, INTRO DISCRETE MATH
  • [4] CHATRRAND G, 1993, APPL ALGORITHMIC GRA
  • [5] Harary F., 1995, GRAPH THEORY
  • [6] HOROWITZ E, 1997, COMPUTER ALGORITHM C
  • [7] HOROWITZ E, 1995, COMPUTER ALGORITHMS
  • [8] KRUSE R, 1991, DATA STRUCTURES PROG
  • [9] Rao S, 1996, ENG OPTIMIZATION
  • [10] SEDGEWICK R, 1992, ALGORITHMS CPLUSPLUS