Using fast volume approximation for computing Ehrhart polynomials
- Suitable for
- Undergraduate thesis
- Prerequisites
- programming in JuliaLang
We propose a new algorithm for computing the Ehrhart polynomial by approximating the volume of dilated polytopes and interpolate. This project will make use of the C/C++ software developed by GeomScale and JuliaLang. The project has a large experimental part and an algorithm development part.