An Algorithm for Three-Dimensional Orthogonal Graph Drawing

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-37623-2_25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1998English

Colorability in Orthogonal Graph Drawing

English

Towards an Aesthetic Invariant for Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem With Unloading Constraints

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2014English

Using Graph Parsing for Automatic Graph Drawing

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
ControlSystems EngineeringInformation SystemsHuman-Computer InteractionElectronic EngineeringComputer Science ApplicationsElectricalSoftware
1998English

Drawing Clustered Graphs on an Orthogonal Grid

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Metrics for Graph Drawing Aesthetics

Journal of Visual Languages and Computing
LinguisticsComputer Science ApplicationsHuman-Computer InteractionLanguage
2002English

Every Graph Admits an Unambiguous Bold Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Three-Dimensional 1-Bend Graph Drawings

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy