Skip to main content
Log in

Optimal st-orientations for plane triangulations

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

For plane triangulations, it has been proved that there exists a plane triangulation G with n vertices such that for any st-orientation of G, the length of the longest directed paths of G in the st-orientation is \(\geq\lfloor\frac{2n}{3}\rfloor\) (Zhang and He in Lecture Notes in Computer Science, vol. 3383, pp. 425–430, 2005). In this paper, we prove the bound \(\frac{2n}{3}\) is optimal by showing that every plane triangulation G with n-vertices admits an st-orientation with the length of its longest directed paths bounded by \(\frac{2n}{3}+O(1)\) . In addition, this st-orientation is constructible in linear time. A by-product of this result is that every plane graph G with n vertices admits a visibility representation with height \(\le\frac{2n}{3}+O(1)\) , constructible in linear time, which is also optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chiang Y-T, Lin C-C, Lu H-I (2001) Orderly spanning trees with applications to graph encoding and graph drawing. In: Proceedings of the 12th annual ACM-SIAM SODA. ACM Press, New York, pp 506–515

    Google Scholar 

  • di Battista G, Eades P, Tammassia R, Tollis I (1998) Graph drawing: algorithms for the visualization of graphs. Hall, New York

    Google Scholar 

  • Ebert J (1983) st-ordering the vertices of biconnected graphs. Computing 30(1):19–33

    Article  MATH  MathSciNet  Google Scholar 

  • Even S, Tarjan R (1976) Computing an st-numbering. Theor Comput Sci 2:339–344

    Article  MATH  MathSciNet  Google Scholar 

  • Fraysseix HD, de Mendez PO, Rosenstiehl P (1995) Bipolar orientations revisited. Discrete Appl Math 56:157–179

    Article  MATH  MathSciNet  Google Scholar 

  • Kant G (1997) A more compact visibility representation. Int J Comput Geom Appl 7:197–210

    Article  MathSciNet  Google Scholar 

  • Kant G, He X (1997) Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor Comput Sci 172:175–193

    Article  MATH  MathSciNet  Google Scholar 

  • Lempel A, Even S, Cederbaum I (1967) An algorithm for planarity testing of graphs. In: Theory of graphs, proceedings of an international symposium, Rome, July 1966, pp 215–232

  • Lin C-C, Lu H-I, Sun I-F (2004) Improved compact visibility representation of planar graph via Schnyder’s realizer. SIAM J Discrete Math 18:19–29

    Article  MATH  MathSciNet  Google Scholar 

  • Maon Y, Schieber B, Vishkin U (1986) Parallel ear decomposition search (eds) and st-numbering in graphs. Theor Comput Sci 47:277–298

    Article  MATH  MathSciNet  Google Scholar 

  • Ossona de Mendez P (1994) Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris

  • Papakostas A, Tollis IG (1998) Algorithms for area-efficient orthogonal drawings. Comput Geom Theory Appl 9:83–110

    MATH  MathSciNet  Google Scholar 

  • Papamanthou C, Tollis IG (2007) Applications of parameterized st-orientations in graph drawings. In: Proceedings of 13th international symposium on graph drawing. Lecture notes in computer science, vol 3843. Springer, Berlin, pp 355–367

    Google Scholar 

  • Rosenstiehl P, Tarjan RE (1986) Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput Geom 1:343–353

    Article  MATH  MathSciNet  Google Scholar 

  • Schnyder W (1989) Planar graphs and poset dimension. Order 5:323–343

    Article  MATH  MathSciNet  Google Scholar 

  • Tamassia R, Tollis IG (1986) An unified approach to visibility representations of planar graphs. Discrete Comput Geom 1:321–341

    Article  MATH  MathSciNet  Google Scholar 

  • Tarjan R (1986) Two streamlined depth-first search algorithms. Fundam Inform 9:85–94

    MATH  MathSciNet  Google Scholar 

  • Zhang H, He X (2005) New theoretical bounds of visibility representation of plane graphs. In: Proceedings of GD’2004. Lecture notes in computer science, vol 3383. Springer, Berlin, pp 425–430

    Google Scholar 

  • Zhang H, He X (2006) Nearly optimal visibility representations of plane graphs. In: Proceedings of ICALP’06. Lecture notes in computer science, vol 4051. Springer, Berlin, pp 407–418

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huaming Zhang.

Additional information

A preliminary version of this paper was presented at AAIM 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, H., He, X. Optimal st-orientations for plane triangulations. J Comb Optim 17, 367–377 (2009). https://doi.org/10.1007/s10878-007-9119-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9119-8

Keywords

Navigation