Manhattan-Geodesic Embedding of Planar Graphs

@inproceedings{Katz2009ManhattanGeodesicEO,
  title={Manhattan-Geodesic Embedding of Planar Graphs},
  author={Bastian Katz and Marcus Krug and Ignaz Rutter and Alexander Wolff},
  booktitle={Graph Drawing},
  year={2009}
}
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains of axis-parallel line segments, that is, as geodesics with respect to the Manhattan metric. First, we show that geodesic embeddability on the grid is equivalent to 1-bend embeddability on the grid. For the latter question an efficient algorithm has been proposed. Second, we consider geodesic point-set embeddability… CONTINUE READING
Highly Cited
This paper has 69 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

70 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On Embedding a Graph in the Grid with the Minimum Number of Bends

SIAM J. Comput. • 1987
View 3 Excerpts
Highly Influenced

Simple polygonizations

E. Demaine
http://erikdemaine.org/polygonization/, • 2007
View 1 Excerpt

Embedding Planar Graphs at Fixed Vertex Locations

Graphs and Combinatorics • 2001
View 2 Excerpts

Theoretical results on at most 1-bend embeddability of graphs

Y. Liu, P. Marchioro, R. Petreschi, B. Simeone
Acta Math. Appl. Sinica (English Ser.), • 1992
View 2 Excerpts