Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99527
DC FieldValue
dc.titleHeuristics approach to automatic data flow diagram layout
dc.contributor.authorTan, K.P.
dc.contributor.authorOng, G.H.
dc.contributor.authorWong, P.
dc.date.accessioned2014-10-27T06:05:00Z
dc.date.available2014-10-27T06:05:00Z
dc.date.issued1993
dc.identifier.citationTan, K.P.,Ong, G.H.,Wong, P. (1993). Heuristics approach to automatic data flow diagram layout. Proceeding of the 6th International Workshop on Computer-Aided Software Engineering : 314-323. ScholarBank@NUS Repository.
dc.identifier.isbn0818634812
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99527
dc.description.abstractThis paper presents a Heuristics method for the automatic placement of DFDs. It fulfills the whole set of aesthetics requirement for a nice DFD layout within acceptable timebound. The system allocates the process with most data flows at the center of a 2D grid space and effectively handles the positional preference for entities, processes and data stores. The Testcut function detects any crisscrossing of data flows and any cutting of DFD objects. The Pop function pops up those objects of high intersection weightage to the upper layer under aesthetics optimization. This 3D DFD contains only linear data flows with all crisscrossings eliminated. A non-cutting connection between two objects can be seen clearly by rotating the 3D DFD at every 90 degree step. Thus the Heuristics method realizes the abstraction of the Automatic Diagram Creation.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleProceeding of the 6th International Workshop on Computer-Aided Software Engineering
dc.description.page314-323
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.