Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities
From MaRDI portal
Publication:3299334
zbMath1444.52003arXiv1512.07768MaRDI QIDQ3299334
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1512.07768
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Length, area, volume and convex sets (aspects of convex geometry) (52A38)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- The volume of simplices clipped by a half space
- The problem of calculating the volume of a polyhedron is enumerably hard
- Polytope Volume Computation
- On the Complexity of Computing the Volume of a Polyhedron
- The volume of duals and sections of polytopes
- Spline Notation Applied to a Volume Problem
- What is known about unit cubes
This page was built for publication: Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities