Some more n‐dimensional geometry†
From MaRDI portal
Publication:4299940
DOI10.1080/0020739940250208zbMath0803.52009OpenAlexW1999743784MaRDI QIDQ4299940
Publication date: 2 January 1995
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739940250208
(n)-dimensional polytopes (52B11) Polyhedra and polytopes; regular figures, division of spaces (51M20) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Length, area and volume in real or complex geometry (51M25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric inequality and the complexity of computing volume
- Computing the volume is difficult
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- Geominimal surface area
- Polar reciprocal convex bodies
- On the Complexity of Computing the Volume of a Polyhedron
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Somen‐dimensional geometry
- Convexity
This page was built for publication: Some more n‐dimensional geometry†