Skip to main content

Approximation of the Volume

  • Chapter
Generalized Curvatures

Part of the book series: Geometry and Computing ((GC,volume 2))

  • 1656 Accesses

We deal here with a basic question: consider a smooth (compact oriented) submanifold Mn of the Euclidean space EN, n < N, and a (measurable) subset W, “close to Mn.” Can we approximate the volume Vol n (Mn) of Mn by Vol n (W)? We have seen in Sect. 3.1.3 that the well-known “Lantern of Schwarz” shows that the area of a sequence of triangulations inscribed in a fixed cylinder of E3 may tend to infinity when the sequence tends to the cylinder for the Hausdorff topology. We give here a general approximation theorem by adding a suitable geometric assumption: we assume that the tangent bundle of the sequence tends to the tangent bundle of Mn, in precise sense.

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.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.

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Approximation of the Volume. In: Generalized Curvatures. Geometry and Computing, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73792-6_13

Download citation

Publish with us

Policies and ethics