v0.0.3

Major Changes:

• Modified the literature grid generating algorithm into a brand new one to create only "internal" points that belong to the given order of a simplex (e.g. tetrahedron), thus excluding lower order ones (e.g. for a tetrahedron -> points, lines, triangles). The effect is the same as removing all points containing zeros, but it is ((M+N-1) choose (N-1)) / ((M-1) choose (N-1)) times faster, or e.g. 763 times faster to find internal grid of 9-simplex with dimensions divided by 12 :)
• Added internal grid generator with fractional output
• Added a simple command line interface for some quick single-time results convenience and testing

Full Changelog: v0.0.2...v0.0.3