Results 21 to 30 of about 57,181 (227)
Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Examining graphic drawing skills for a socioscientific problem situation
LUMAT, 2022 The aim of the study is to examine the graphing skills of prospective elementary mathematics teachers for a socioscientific problem situation related to Covid-19.
Mehmet İhsan Yurtyapan +1 more
doaj +1 more source
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Paul Holleis +2 more
openaire +1 more source
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
Drawing planar graphs with many collinear vertices
Journal of Computational Geometry, 2018 Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices?
Giordano Da Lozzo +4 more
doaj +1 more source
Demonstration of a Preprocessor for the Spring Embedder [PDF]
, 2002 Spring embedding is a widely used method for producing automated layouts of graphs. We present a preprocessor that improves the performance of the classical spring embedder which can be used in conjunction with other optimization and approximation ...
Rodgers, Peter +3 more
core +1 more source
Thickness and antithickness of graphs
Journal of Computational Geometry, 2018 This paper studies questions about duality between crossings and non-crossings in graph drawings via the notions of thickness and antithickness. The thickness of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the edges can be ...
Vida Dujmović, David R. Wood
doaj +1 more source
Journal of Graph Algorithms and Applications, 2002 Summary: Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.
Carsten Friedrich, Peter Eades
openaire +2 more sources
Simple Algorithms for Network Visualization: A Tutorial
Tsinghua Science and Technology, 2012 The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn.
Michael J. McGuffin
doaj +1 more source