Embedding vertices at points: Few bends suffice for planar graphs.

Kaufmann, Michael; Wiese, Roland

Displaying similar documents to “Embedding vertices at points: Few bends suffice for planar graphs.”

On the perspectives opened by right angle crossing drawings.

Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)

Journal of Graph Algorithms and Applications

Similarity:

Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.

Wood, David R. (2003)

Journal of Graph Algorithms and Applications

Similarity:

Simultaneous embedding of planar graphs with few bends.

Erten, Cesim, Kobourov, Stephen G. (2005)

Journal of Graph Algorithms and Applications

Similarity:

Straight-line drawings on restricted integer grids in two and three dimensions.

Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)

Journal of Graph Algorithms and Applications

Similarity:

Geometric simultaneous embeddings of a graph and a matching.

Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)

Journal of Graph Algorithms and Applications

Similarity:

Drawing clustered graphs on an orthogonal grid.

Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)

Journal of Graph Algorithms and Applications

Similarity:

Drawing planar graphs with large vertices and thick edges.

Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)

Journal of Graph Algorithms and Applications

Similarity:

Visual analysis of one-to-many matched graphs.

Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)

Journal of Graph Algorithms and Applications

Similarity:

Morphing planar graph drawings with bent edges.

Lubiw, Anna, Petrick, Mark (2011)

Journal of Graph Algorithms and Applications

Similarity:

Drawing $K_{n}$ in three dimensions with one bend per edge.

Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)

Journal of Graph Algorithms and Applications

Similarity:

New lower bounds for orthogonal drawings.

Biedl, Therese C. (1998)

Journal of Graph Algorithms and Applications

Similarity:

On the number of planar orientations with prescribed degrees.

Felsner, Stefan, Zickfeld, Florian (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Drawing graphs on two and three lines.

Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)

Journal of Graph Algorithms and Applications

Similarity: