Results 231 to 240 of about 7,574 (255)
Some of the next articles are maybe not open access.
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees
2018We prove that every n-node ternary tree has a planar straight-line orthogonal drawing in \(O(n^{1.576})\) area, improving upon the previously best known \(O(n^{1.631})\) bound. Further, we present an upper bound, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete
Barbara Covella +2 more
openaire +2 more sources
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
On the area requirements of planar straight-line orthogonal drawings of ternary trees
Theoretical Computer Science, 2021Fabrizio Frati, Maurizio Patrignani
exaly
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications, 2012Fabrizio Frati
exaly
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry: Theory and Applications, 2005Giuseppe Liotta +2 more
exaly
Straight-Line Rectangular Drawings of Clustered Graphs
Discrete and Computational Geometry, 2010Fabrizio Frati +2 more
exaly