A heuristic algorithm for drawing of a flow diagram

δείτε την πρωτότυπη σελίδα τεκμηρίου
στον ιστότοπο του αποθετηρίου του φορέα για περισσότερες πληροφορίες και για να δείτε όλα τα ψηφιακά αρχεία του τεκμηρίου*



A heuristic algorithm for drawing of a flow diagram (EN)

Frangopoulos, CA (EN)
Grekas, DN (EN)

journalArticle (EN)

2014-03-01T01:51:01Z
2001 (EN)


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. (EN)

Computer Science, Interdisciplinary Applications (EN)
Computer Science, Software Engineering (EN)

flow diagram (EN)
engineering systems (EN)
intelligent CAD (EN)
heuristics (EN)
graph-models (EN)

ADVANCES IN ENGINEERING SOFTWARE (EN)

Αγγλική γλώσσα

ELSEVIER SCI LTD (EN)




*Η εύρυθμη και αδιάλειπτη λειτουργία των διαδικτυακών διευθύνσεων των συλλογών (ψηφιακό αρχείο, καρτέλα τεκμηρίου στο αποθετήριο) είναι αποκλειστική ευθύνη των αντίστοιχων Φορέων περιεχομένου.