Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Online-Ressource
    Online-Ressource
    Berlin u.a. : Springer
    UID:
    b3kat_BV035719969
    Umfang: 1 Online-Ressource (XIII, 184 S. , graph. Darst.)
    ISBN: 354057090X , 038757090X
    Serie: Lecture notes in computer science 704
    Anmerkung: Zugl.: Karlsruhe, Univ., Diss., 1991
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Online-Ressource
    Online-Ressource
    Berlin [u.a.] : Springer
    UID:
    gbv_595126324
    Umfang: Online-Ressource (XIII, 184 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540478980
    Serie: Lecture notes in computer science 704
    Inhalt: 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.
    Inhalt: 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.
    Anmerkung: Zugl.: Karlsruhe, Univ., Diss., 1991
    Weitere Ausg.: ISBN 354057090X
    Weitere Ausg.: ISBN 9783540570905
    Weitere Ausg.: Druckausg. Paulisch, Frances Newbery The design of an extendible graph editor Berlin : Springer, 1993 ISBN 354057090X
    Weitere Ausg.: ISBN 038757090X
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    Schlagwort(e): Graphischer Editor ; Hochschulschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186113002883
    Umfang: 1 online resource (XVI, 196 p.)
    Ausgabe: 1st ed. 1993.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47898-1
    Serie: Lecture Notes in Computer Science, 704
    Inhalt: 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.
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-57090-X
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649300387
    Umfang: Online-Ressource
    ISBN: 9783540478980
    Serie: Lecture Notes in Computer Science 704
    Weitere Ausg.: ISBN 9783540570905
    Weitere Ausg.: Buchausg. u.d.T. Paulisch, Frances Newbery The design of an extendible graph editor Berlin : Springer, 1993 ISBN 354057090X
    Weitere Ausg.: ISBN 038757090X
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    Schlagwort(e): Graphischer Editor
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Buch
    Buch
    Berlin u.a. : Springer
    UID:
    b3kat_BV008271922
    Umfang: XIII, 184 S. , graph. Darst.
    ISBN: 354057090X , 038757090X
    Serie: Lecture notes in computer science 704
    Anmerkung: Zugl.: Karlsruhe, Univ., Diss., 1991
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Buch
    Buch
    Berlin u.a. :Springer,
    UID:
    almahu_BV008271922
    Umfang: XIII, 184 S. : graph. Darst.
    ISBN: 3-540-57090-X , 0-387-57090-X
    Serie: Lecture notes in computer science 704
    Anmerkung: Zugl.: Karlsruhe, Univ., Diss., 1991
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Buch
    Buch
    Berlin u.a. :Springer,
    UID:
    almafu_BV008271922
    Umfang: XIII, 184 S. : graph. Darst.
    ISBN: 3-540-57090-X , 0-387-57090-X
    Serie: Lecture notes in computer science 704
    Anmerkung: Zugl.: Karlsruhe, Univ., Diss., 1991
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Buch
    Buch
    Berlin : Springer
    UID:
    gbv_272030481
    Umfang: XIII, 184 S. , graph. Darst.
    ISBN: 354057090X , 038757090X
    Serie: Lecture notes in computer science 704
    Anmerkung: Literaturverz. S. [171] - 181 , Zugl.: Karlsruhe, Univ., Diss., 1991
    Weitere Ausg.: Online-Ausg. Paulisch, Frances N. The Design of an Extendible Graph Editor Berlin, Heidelberg : Springer Berlin Heidelberg, 1993 ISBN 9783540478980
    Weitere Ausg.: Online-Ausg. Paulisch, Frances Newbery The design of an extendible graph editor Berlin [u.a.] : Springer, 1993 ISBN 9783540478980
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    RVK:
    Schlagwort(e): Graphischer Editor ; Hochschulschrift
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    UID:
    almahu_9947921012902882
    Umfang: XVI, 196 p. , online resource.
    ISBN: 9783540478980
    Serie: Lecture Notes in Computer Science, 704
    Inhalt: 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.
    Anmerkung: 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.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540570905
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9948621706202882
    Umfang: XVI, 196 p. , online resource.
    Ausgabe: 1st ed. 1993.
    ISBN: 9783540478980
    Serie: Lecture Notes in Computer Science, 704
    Inhalt: 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.
    Anmerkung: 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.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662206669
    Weitere Ausg.: Printed edition: ISBN 9783540570905
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 354050060x?
Meinten Sie 351057009x?
Meinten Sie 354007080x?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz