Results 251 to 260 of about 4,519,520 (279)
Optimizing area and aspect ratio in straight-line orthogonal tree drawings [PDF]
Computational Geometry: Theory and Applications, 2002 We investigate the problem of drawing an arbitrary n-node binary tree orthogonally and upwardly in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while also allowing the aspect ratio to be chosen ...
Timothy M. Chan +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Angular resolution of straight-line drawings (abstract)
ACM SIGACT News, 1993An orthogonal drawing of a graph is such that the edges are represented by polygonal chains consisting of horizontal and vertical segments. The intermediate vertices of the chain (which are not vertices of the graph) are called bends. In this talk we survey algorithms for constructing planar orthogonal drawings.
openaire +2 more sources
Drawing straight lines with a pyramid cellular automaton
Information Processing Letters, 1982This paper gives an efficient algorithm for drawing a straight line through two given points in a digitized picture, where the picture is stored one pixel per processor at the base of a pyramid cellular automaton (PCA). Dyer [l] defines a PCA to be a finite-state automaton which is replicated at each node of a finite, complete 4-ary tree, but for our ...
openaire +2 more sources
Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
Discrete Mathematics, Algorithms and Applications, 2013A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs.
Md. Iqbal Hossain 0001 +1 more
openaire +3 more sources
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Algorithmica, 2005Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization and VLSI design. Drawing algorithms for hierarchical
Peter Eades +3 more
openaire +1 more source
3D straight-line grid drawing of 4-colorable graphs
Information Processing Letters, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CALAMONERI, Tiziana, STERBINI, Andrea
openaire +1 more source
An Application of Euclid’s Algorithm to Drawing Straight Lines
1985An algorithm is proposed which uses Euclid’s Algorithm to control two production rules which can construct the “best-fit” incremental line. The advantages of its implementation are discussed.
C. M. A. Castle, M. L. V. Pitteway
openaire +1 more source
A Study on the Straight-Line Drawing Tasks for the Non-sighted People
2007A new ruler employs the finger touch to be the main pointing sensor with two locators at the two ends, and a unique pen in a smooth track to draw a line. The tasks of making straight line with two difference rulers (Ruler S: ruler used at school; Ruler C: new touch ruler) between non-sighted people (blindfolds and blinds) were observed: (1) free-line; (
Chih-Fu Wu +4 more
openaire +1 more source
Extending Biconnected Straight-Line Planar Drawings
The Partial Drawing Extensibility problem, for short PDE, takes as input a triple $\langle G,H,Γ_H\rangle$, where $G$ is a planar graph, $H$ is a subgraph of $G$, and $Γ_H$ is a straight-line planar drawing of $H$, and asks whether $Γ_H$ can be extended to a straight-line planar drawing of $G$. Patrignani [Int. J. Found. Comput. Sci.Andreola, Giordano +7 more
openaire +1 more source