Skip to main content

Globally Rigid Ball-Polyhedra in Euclidean 3-Space

  • Chapter
Book cover Transactions on Computational Science XX

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 8110))

  • 825 Accesses

Abstract

The rigidity theorems of Alexandrov (1950) and Stoker (1968) are classical results in the theory of convex polyhedra. We prove analogues of them for ball-polyhedra, which are intersections of finitely many congruent balls in Euclidean 3-space.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Aigner, M., Ziegler, G.M.: Proofs from The Book, 4th edn. Springer, Berlin (2010)

    Book  Google Scholar 

  2. Aurenhammer, F., Klein, R.: Voronoi Diagrams. In: Handbook of Computational Geometry, pp. 201–290. North-Holland, Amsterdam (2000)

    Chapter  Google Scholar 

  3. Alexandrov, A.D.: Convex Polyhedra. Springer, Berlin (2005)

    MATH  Google Scholar 

  4. Bezdek, K., Naszódi, M.: Rigidity of Ball-Polyhedra in Euclidean 3-Space. European J. Combin. 27(2), 255–268 (2005)

    Article  Google Scholar 

  5. Bezdek, K., Lángi, Z., Naszódi, M., Papez, P.: Ball-Polyhedra. Discrete Comput. Geom. 38(2), 201–230 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bezdek, K.: Classical Topics in Discrete Geometry. CMS Books in Mathematics. Springer, New York (2010)

    Book  MATH  Google Scholar 

  7. Bezdek, K., Naszódi, M.: Rigid Ball-polyhedra in Euclidean 3-Space. Discrete Comput. Geom., 1–14 (to appear)

    Google Scholar 

  8. Cauchy, A.L.: Sur les polygones et polyèdres, Second mémoire. J. de l’Ecole Polythéchnique 9, 87–98 (1813)

    Google Scholar 

  9. Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the Shape of a Set of Points in the Plane. IEEE Trans. Inform. Theory 29(4), 551–559 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kupitz, Y.S., Martini, H., Perles, M.A.: Ball Polytopes and the Vázsonyi Problem. Acta Math. Hungar. 126(1-2), 99–163 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Pak, I.: Lectures on Discrete and Polyhedral Geometry, 1–440 (2010), http://www.math.ucla.edu/~pak/geompol8.pdf,

  12. Sabitov, I.K.: Around the Proof of the Legendre-Cauchy Lemma on Convex Polygons. Siberian Math. J. 45(4), 740–762 (2004)

    Article  MathSciNet  Google Scholar 

  13. Seidel, R.: Exact Upper Bounds for the Number of Faces in d-Dimensional Voronoi Diagrams. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Applied Geometry and Discrete Mathematics 4, 517–529 (1991)

    MathSciNet  Google Scholar 

  14. Stoker, J.J.: Geometric Problems Concerning Polyhedra in the Large. Com. Pure and Applied Math. 21, 119–168 (1968)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bezdek, K. (2013). Globally Rigid Ball-Polyhedra in Euclidean 3-Space. In: Gavrilova, M.L., Tan, C.J.K., Kalantari, B. (eds) Transactions on Computational Science XX. Lecture Notes in Computer Science, vol 8110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41905-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41905-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-41905-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics