|
excgrid 0.1.0
Grid + XC-kernel + D3 library
|
#include <grid.hpp>
Public Member Functions | |
| std::size_t | Size () const noexcept |
| std::size_t | Degree () const noexcept |
| std::array< double, 3 > | Point (std::size_t index) const noexcept |
| double | Weight (std::size_t index) const noexcept |
Static Public Member Functions | |
| static Result< AngularGrid > | Create (std::size_t pointCount) |
Static Public Attributes | |
| static constexpr std::span< const std::size_t, internal::kLebedevSizeCount > | kAvailableSizes |
| The available point counts, smallest first. | |
A Lebedev-Laikov angular quadrature on the unit sphere.
The point set is closed under the octahedral group and the weights integrate every polynomial of total degree <= Degree() exactly. The tables are SOLVED for from these two defining conditions by tools/gen_lebedev.py (no copied tables) and certified per size to max |moment residual| < 1e-60. Weights are normalized so that they sum to 4 pi, the area of the unit sphere.