Skip to main content

Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem

  • Chapter
Discrete and Computational Geometry

Part of the book series: Algorithms and Combinatorics ((AC,volume 25))

Abstract

A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a special case of the Generalized Lower Bound Theorem for convexpo lytopes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Artur Andrzejak and Emo Welzl, In between k-sets, j-facets, and i-faces: (i, j)-partitions, Discrete Comput. Geom. 29 (2003), 105–131.

    MathSciNet  MATH  Google Scholar 

  2. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, and Emo Welzl, Results on k-sets and j-facets via continuous motion, in“Proc 14th Ann. ACM Symp. on Comput.Geom.” (1998), 192–199.

    Google Scholar 

  3. Paul Erdos, Laszlo Lovasz, A. Simmons, and Ernst G. Straus, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory (J.N. Srivastava et al., Eds.), North Holland (1973), 139–149.

    Google Scholar 

  4. Carl W. Lee, Winding numbers and the generalized lower-bound conjecture, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6 (1991), 209–219.

    Google Scholar 

  5. Laszlo Lovasz, On the number of halving lines, Ann. Universitatis Scientarium Budapest, E¨otv¨os, Sectio Mathematica 14 (1971), 107–108.

    MathSciNet  Google Scholar 

  6. Peter McMullen, On simple polytopes, Inventiones Math. 113 (1993), 419–444.

    Article  MathSciNet  MATH  Google Scholar 

  7. Janos Pach and Rom Pinchasi, On the number of balanced lines, Discrete Comput. Geom. 25 (2001), 611–628.

    Article  MathSciNet  MATH  Google Scholar 

  8. Richard P. Stanley, The number of faces of simplicial polytopes and spheres, in “Discrete Geometry and Convexity”, (J. E. Goodman, E. Lutwak, J. Malkevitch, and R. Pollack, Eds.), Annals NewY ork Academy of Sciences 440 (1985), 212–223.

    Google Scholar 

  9. Emo Welzl, Entering and leaving j-facets, Discrete Comput. Geom. 25 (2001), 351–364.

    MathSciNet  MATH  Google Scholar 

  10. Gunter M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, Springer-Verlag (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sharir, M., Welzl, E. (2003). Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds) Discrete and Computational Geometry. Algorithms and Combinatorics, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55566-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55566-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62442-1

  • Online ISBN: 978-3-642-55566-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics