Results 231 to 240 of about 28,541 (252)
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
Re-embedding a 1-plane graph for a straight-line drawing in linear time
Theoretical Computer Science, 2021Seok-Hee Hong
exaly
On the area requirements of planar straight-line orthogonal drawings of ternary trees
Theoretical Computer Science, 2021Fabrizio Frati, Maurizio Patrignani
exaly
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
Lecture Notes in Computer Science, 2016Seok-Hee Hong +2 more
exaly