Drawing graphs within restricted area

DOI10.1007/978-3-662-45803-7_31MaRDI QIDQ2936945zbMATH OpenOpenAlexFDO

Authors Maximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff

Publication date 7 January 2015

Published in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.0499

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school students make when transforming mathematical expressions in the process of calculating, for example, sums of fractions.

Recommendations

• scientific article; zbMATH DE number 1990778
• Drawing graphs with large vertices and thick edges.
• scientific article; zbMATH DE number 1182937
• Graph graphics: Theory and practice
• An algorithm for drawing general undirected graphs

Cited in

(3)

• Limitations on realistic hyperbolic graph drawing
• Drawing Graphs Within Graphs
• Graph Stories in Small Area

This page was built for publication: Drawing graphs within restricted area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936945)