このページのリンク

<電子ブック>
The Design of an Extendible Graph Editor / by Frances N. Paulisch
(Lecture Notes in Computer Science. ISSN:16113349 ; 704)

1st ed. 1993.
出版者 (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年 1993
本文言語 英語
大きさ XVI, 196 p : online resource
著者標目 *Paulisch, Frances N author
SpringerLink (Online service)
件 名 LCSH:Application software
LCSH:Software engineering
LCSH:Computer graphics
LCSH:Computer programming
LCSH:Discrete mathematics
FREE:Computer and Information Systems Applications
FREE:Software Engineering
FREE:Computer Graphics
FREE:Programming Techniques
FREE:Discrete Mathematics
一般注記 Definition 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
Graphs 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
HTTP:URL=https://doi.org/10.1007/BFb0019371
目次/あらすじ

所蔵情報を非表示

電子ブック オンライン 電子ブック

Springer eBooks 9783540478980
電子リソース
EB00225405

書誌詳細を非表示

データ種別 電子ブック
分 類 LCC:QA76.76.A65
DC23:005.3
書誌ID 4001090179
ISBN 9783540478980

 類似資料