Abstract
Graph drawing and layout algorithms are gaining growing interest and importance for the visualization of complex data structures. But, despite many algorithms and concepts, there is no satisfactory solution to the central problem of the criteria for good and readable layouts. We approach this problem and evaluate layout algorithms by comparing their effect on a large set of sample graphs. In each run we compute statistical data which is collected and evaluated. Our experiments show that traditional layout criteria, such as minimal area or maximal edge length or straight line edges, are not as important as they may appear. Balance is often better than optimization, and displaying the intended and inherited structure of a graph is often more important than these formal cost criteria.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
