Small sets supporting fary embeddings of planar graphs

Authors:
Hubert de Fraysseix;Já/nos Pach;Richard Pollack
Affiliations:
CNRS, Paris/ supported in part by P.R.C. Mathematiques et Informatique;Mathematical Institute of the Hungarian Academy of Sciences;Courant Institute, NYU
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 4
Cited 33

Efficient Planarity Testing

Journal of the ACM (JACM)
Computational Aspects of VLSI

Computational Aspects of VLSI
Slimming down search structures: A functional approach to algorithm design

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Universality considerations in VLSI circuits

IEEE Transactions on Computers

Optimal parallel algorithms for transitive closure and point location in planar structures

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Detecting and decomposing self-overlapping curves

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Area requirement and symmetry display in drawing graphs

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Area-efficient upward tree drawings

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Angles of planar triangular graphs

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized graph drawing with heavy-duty preprocessing

AVI '94 Proceedings of the workshop on Advanced visual interfaces
An experimental comparison of three graph drawing algorithms (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Convex drawings of graphs in two and three dimensions (preliminary version)

Proceedings of the twelfth annual symposium on Computational geometry
Disk packings and planar separators

Proceedings of the twelfth annual symposium on Computational geometry
Separators for sphere-packings and nearest neighbor graphs

Journal of the ACM (JACM)
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Parametric Graph Drawing

IEEE Transactions on Software Engineering
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing Outer-Planar Graphs in O(n log n) Area

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Simple and efficient floor-planning

Information Processing Letters
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs

Information Processing Letters
On simultaneous straight-line grid embedding of a planar graph and its dual

Information Processing Letters
Greedy drawings of triangulations

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A near-linear time algorithm for computing replacement paths in planar directed graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Representation of planar hypergraphs by contacts of triangles

GD'07 Proceedings of the 15th international conference on Graph drawing
A near-linear-time algorithm for computing replacement paths in planar directed graphs

ACM Transactions on Algorithms (TALG)
An automatic layout algorithm for BPEL processes

Proceedings of the 5th international symposium on Software visualization
On touching triangle graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
A center transversal theorem for hyperplanes and applications to graph drawing

Proceedings of the twenty-seventh annual symposium on Computational geometry
Visual change tracking for business process models

ER'11 Proceedings of the 30th international conference on Conceptual modeling
Optimal polygonal representation of planar graphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Planar straight-line drawing in an O(n)×O(n) grid with angular resolution Ω(1/n)

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Convex drawings of 3-connected plane graphs

GD'04 Proceedings of the 12th international conference on Graph Drawing
On the complexity of network synchronization

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Leftist canonical ordering

GD'09 Proceedings of the 17th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Minimum-width grid drawings of plane graphs

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n vertices has a Fáry embedding (i.e., straight-line embedding) on the 2n - 4 by n - 2 grid and provide an &Ogr;(n) space, &Ogr;(n log n) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any set F, which can support a Fáry embedding of every planar graph of size n, has cardinality at least n + (1 - &ogr;(1)) √n which settles a problem of Mohar.