Results 271 to 280 of about 29,184 (301)
Some of the next articles are maybe not open access.
Flexible Graph Layout for the Web
Journal of Visual Languages & Computing, 2002More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most important types of structured graphical information. Here we demonstrate how XML can be used as the basis for contents-based delivery of graph-based diagrams.
Trevor Hansen +3 more
openaire +1 more source
Symmetric Layout of Disconnected Graphs
2003We present a linear time algorithm for drawing disconnected planar graphs with maximum number of symmetries. Our algorithm can be generalized to making symmetric arrangements of bounded disjoint objects in the plane.
Seok-Hee Hong 0001, Peter Eades
openaire +1 more source
A graph grammar‐based approach for graph layout
Software: Practice and Experience, 2018SummaryAs a two‐dimensional formal tool, graph grammars are capable of handling the layout problems of visual programming languages. Based on an edge‐based graph grammar (EGG), this paper proposes a novel layout approach that uses the unique features of EGG and overcomes the weakness of existing layout approaches. In order to make the approach rigorous
Yufeng Liu +3 more
openaire +1 more source
Layout Problems on Lattice Graphs
1999This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process.
Josep Díaz +3 more
openaire +1 more source
Linear layouts of weakly triangulated graphs
Discrete Mathematics, Algorithms and Applications, 2014A graph [Formula: see text] is said to be triangulated if it has no chordless cycles of length 4 or more. Such a graph is said to be rigid if, for a valid assignment of edge lengths, it has a unique linear layout and non-rigid otherwise. Damaschke [Point placement on the line by distance data, Discrete Appl. Math.
Asish Mukhopadhyay +3 more
openaire +1 more source
A Maxent-Stress Model for Graph Layout
IEEE Transactions on Visualization and Computer Graphics, 2012In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial all-pairs shortest path calculation. A number of
Emden R. Gansner +2 more
openaire +2 more sources
Linear Layout of Directed Grid Graph
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Indra Rajasingh +3 more
openaire +1 more source
Efficient Genealogical Graph Layout
2016While a visual unconstrained tree structure planar layout design is easy to implement, a visualization of a tree with constraints on node ranks and their ordering within ranks leads to a difficult combinatorial problem. A genealogical graph, such as family tree, can be taken as an example of such a case.
openaire +1 more source
Experimenting with Aesthetics-Based Graph Layout
2000Many automatic graph layout algorithms have been implemented to display relational data in a graphical (usually node-arc) manner. The success of these algorithms is typically measured by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimising the number of crossings, maximising symmetry ...
Helen C. Purchase +2 more
openaire +2 more sources
Proceedings of the 4th annual ACM symposium on User interface software and technology - UIST '91, 1991
Tyson R. Henry, Scott E. Hudson
openaire +1 more source
Tyson R. Henry, Scott E. Hudson
openaire +1 more source