Skip to main content
SpringerLink
Log in

Most Finite Point Sets in the Plane have Dilation \(>1\)

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

We prove the following fact for arbitrary finite point sets \(S\) in the plane. Either, S is a subset of one of the well-known sets of points whose triangulation is unique and has dilation 1. Or there exists a number \(\Delta (S) > 1\) such that each finite plane graph containing \(S\) among its vertices has dilation \(\ge \Delta (S)\).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Similar content being viewed by others

References

  1. Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.A.: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D. Discrete Comput. Geom. 39(1–3), 17–37 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H.J., Smid, M.H.M., Vigneron, A.: Sparse geometric graphs with small dilation. Comput. Geom. 40(3), 207–219 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bose, P., Devroye, L., Löffler, M., Snoeyink, J., Verma, V.: The spanning ratio of the Delaunay triangulation is greater than \(\pi /2\). In: CCCG, pp. 165–167 (2009)

  4. Dumitrescu, A., Ebbers-Baumann, A., Grüne, A., Klein, R., Rote, G.: On geometric dilation and halving chords. In: Dehne, F.K.H.A., López-Ortiz, A., Sack, J.-R. (eds.) Algorithms and Data Structures. Proceedings of the 9th International Workshop, WADS 2005, Waterloo, Canada, 15–17 August, 2005. Lecture Notes in Computer Science, vol. 3608, pp. 244–255. Springer, Berlin (2005)

  5. Dumitrescu, A., Ebbers-Baumann, A., Grüne, A., Klein, R., Rote, G.: On the geometric dilation of closed curves, graphs, and point sets. Comput. Geom. Theory Appl. 36(1), 16–38 (2007)

    Article  MATH  Google Scholar 

  6. Ebbers-Baumann, A., Klein, R., Langetepe, E., Lingas, A.: A fast algorithm for approximating the detour of a polygonal chain. CGTA Comput. Geom. Theory Appl. 27, 123–134 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ebbers-Baumann, A., Grüne, A., Klein, R.: The geometric dilation of finite point sets. Algorithmica 44(2), 137–149 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ebbers-Baumann, A., Grüne, A., Klein, R.: Geometric dilation of closed planar curves: new lower bounds. CGTA Comput. Geom. Theory Appl. 37(3), 188–208 (2007)

    Article  MATH  Google Scholar 

  9. Ebbers-Baumann, A., Grüne, A., Klein, R., Karpinski, M., Knauer, C., Lingas, A.: Embedding point sets into plane graphs of small dilation. Int. J. Comput. Geom. Appl. (IJCGA) 17(3), 201–230 (2007)

    Article  MATH  Google Scholar 

  10. Eppstein, D.: Spanning trees and spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry. Elsevier, Amsterdam (2000)

    Google Scholar 

  11. Eppstein, D.: The geometry junkyard. (2014). http://www.ics.uci.edu/~eppstein/junkyard/dilation-free/. Accessed 15 Nov 2014

  12. Eppstein, D., Wortman, K.A.: Minimum dilation stars. CGTA Comput. Geom. Theory Appl. 37(1), 27–37 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Grüne, A., Kamali, S.: On the density of iterated line segment intersections. CGTA Comput. Geom. Theory Appl. 40(1), 23–36 (2008)

    Article  MATH  Google Scholar 

  14. Ismailescu, D., Radoičić, R.: A dense planar point set from iterated line intersections. CGTA Comput. Geom. Theory Appl. 27(3), 257–267 (2004)

    Article  MATH  Google Scholar 

  15. Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7, 13–28 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Klein, R., Kutz, M.: The density of iterated crossing points and a gap result for triangulations of finite point sets. In: Amenta, N., Cheong, O. (eds.) Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, 5–7 June, 2006, pp. 264–272. ACM Press, New York (2006)

  17. Lorenz, D.: On the dilation of finite point sets. Diploma Thesis. Bonn (2005)

  18. Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

Download references

Acknowledgments

This work was partially supported by DFG (Kl 655/ 14-1/3).

Author information

Authors and Affiliations

  1. Department of Computer Science I, University of Bonn, Bonn, Germany

    Rolf Klein, Martin Kutz & Rainer Penninger

Authors
  1. Rolf Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Kutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rainer Penninger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rainer Penninger.

Additional information

M. Kutz—deceased 2007.

An extended abstract of this paper has appeared at SoCG’06 [16].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Klein, R., Kutz, M. & Penninger, R. Most Finite Point Sets in the Plane have Dilation \(>1\) . Discrete Comput Geom 53, 80–106 (2015). https://doi.org/10.1007/s00454-014-9651-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-014-9651-0

Keywords

Search

Navigation