Skip to main content

Sum of Edge Lengths of a Graph Drawn on a Convex Polygon

  • Conference paper
  • First Online:
Discrete and Computational Geometry (JCDCG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2098))

Included in the following conference series:

Abstract

Let x 0,x 1,...x n-1 be vertices of a convex n-gon P in the plane, where, x 0 x 1, x 1 x 2, ... x n-2 x n-1, and x n-1 x 0 are edges of P. Let G = (N, E) be a graph, such that N = {0, 1, ..., n-1}. Consider a graph drawing of G such that each vertex iN is represented by x i and each edge (i, j) ∈ E is drawn by a straight line segment. Denote the sum of lengths of graph edges in such drawing by S P (G). If S P (G) ≤ S P (G′) for any convex n-gon P, then we write as G l G′. This paper shows two necessary and sufficient conditions of G l G′. Moreover, these conditions can be calculated in polynomial time for any given G and G’.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Battista, G. D., Eades, P., Tamassia, R., and Tollis, I. G., Algorithms for drawing graphs: An annotated bibliography, http://www.cs.brown.edu/people/rt/gd-biblio.html, 1994.

  2. Ito, H., Uehara, H., and Yokoyama, M, A consideration on lengths of permutations on a vertex set of a convex polygon, Extended Abstracts of JCDCG’99, Tokai Univ., Nov. 26—27, pp. 40–41, 1999.

    Google Scholar 

  3. Ito, H., Uehara, H., and Yokoyama, M, Lengths of tours and permutations on a vertex set of a convex polygon, Discrete Applied Mathematics, (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ito, H., Uehara, H., Yokoyama, M. (2001). Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-47738-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42306-5

  • Online ISBN: 978-3-540-47738-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics