MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Computing Orthogonal Drawings with the Minimum Number of Bends." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

5 documents found, showing 1 through 5.

ATOM

Computing Orthogonal Drawings with the Minimum Number of Bends
by Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo — 1998 — IEEE Transactions on Computers
…Computing Orthogonal Drawings with the Minimum Number of Bends Paola Bertolazzi y bertola…
Cited by 21 (7 self) – Add To MetaCart

GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends
by Walter Didimo, Antonio Leonforte — 1998 — Graph Drawing (Proc. GD' 97), volume 1353 of Lecture Notes Comput. Sci
…GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends…
Cited by 2 (1 self) – Add To MetaCart

Bibliography
by Abbott And Sarin, J. Geometric Range Searching
… Battista, G., and Didimo, W. (1997). Computing orthogonal drawings with the minimum number of bends…
Add To MetaCart

Computing Orthogonal Drawings in a Variable Embedding Setting
by Walter Didimo, Giuseppe Liotta — 1998 — In [57
… 1 problem of computing an orthogonal drawing with the minimum number of bends is NP…
Cited by 3 (0 self) – Add To MetaCart

Drawing High-Degree Graphs With Small Grid-Size
by Therese C. Biedl, Brendan P. Madden, Ioannis G. Tollis — 1997
… drawing with the minimum number of bends for a planar graph with a fixed planar embedding. In a subsequent…
Add To MetaCart

Showing 1 through 5.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB