000 03373nam a22005175i 4500
001 978-3-540-47898-0
003 DE-He213
005 20160624102027.0
007 cr nn 008mamaa
008 121227s1993 gw | s |||| 0|eng d
020 _a9783540478980
_9978-3-540-47898-0
024 7 _a10.1007/BFb0019371
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 4 _aThe Design of an Extendible Graph Editor
_h[electronic resource] /
_cedited by Frances Newbery Paulisch.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
300 _aXVI, 196 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v704
505 0 _aDefinition of terms -- Related work: Graph editors -- Layout algorithms and layout constraints -- Graphical abstraction -- Persistence -- Extendibility -- EDGE: An extendible graph editor -- Summary and future research -- Conclusion.
520 _aGraphs can be used to convey information about relationships in many applications. State transition diagrams, PERT/CPM charts, and entity-relationship diagrams are a few examples of many applications involving graphs. Typically, nodes in the graph represent items in the application and the edges represent the relationships among these items. A graph editor is an interactive tool that presents a graph to the user pictorially and allows the user to edit the graph. This monograph presents the design of an extendible graph editor, which is a graph editor that can be adapted easily to many different application areas. Several fundamental and recurring problem areas associated with graph editors are investigated and a solution is proposed for each. The topics investigated are: - Graph layout: a layout constraint mechanism is presented which can easily be combined with various graph layout algorithms. - Graphical abstraction: a novel clustering techniquecalled edge concentration is presented which can reduce the apparent complexity of the graph. - Persistence: the graph structures produced by theeditor can be kept in long-term storage using a standardized, external format for graphs. - Extendibility: the design of the proposed graph editor makes it easy to adapt to various applications. To demonstrate their feasibility, the proposed solutions have been incorporated into EDGE, an extendible graph editor protoype.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer graphics.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Graphics.
650 2 4 _aProgramming Techniques.
650 2 4 _aCombinatorics.
700 1 _aNewbery Paulisch, Frances.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540570905
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v704
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0019371
942 _2EBK6227
_cEBK
999 _c35521
_d35521