Monotone Drawings of Planar Graphs

Authors:
János Pach;Géza Tóth
Affiliations:
-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 0
Cited 3

Planar minimally rigid graphs and pseudo-triangulations

Proceedings of the nineteenth annual symposium on Computational geometry
Planar minimally rigid graphs and pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Planar minimally rigid graphs and pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a graph drawn in the plane so that its edges are represented by x-monotone curves, any pair of which cross an even number of times. We show that G can be redrawn in such a way that the x-coordinates of the vertices remain unchanged and the edges become non-crossing straight-linesegments.