Builds a discretization grid covering the two-dimensional unit simplex, with specified number of points and minimal distance from the boundary.
The number of grid nodes on the squared grid containing the desired triangle.
Positive number: minimum distance from any node inside the simplex to the simplex boundary
logical. Is the simplex represented as an equilateral triangle (if
npoints*npoints grid covers either
the equilateral representation of
the simplex, or the right angled one.
In any case, the grid is
rectangular: some nodes lie outside the triangle.
Density computations on such a grid should handle the case when
the point passed as argument is outside the simplex (typically,
the function should return zero in such a case).
A list containing two elements:
Y, vectors of size
npoints, the Cartesian coordinates of the grid nodes.
epsilon is the minimum
distance from any node inside the simplex to the simplex boundary,
after transformation to the right-angled representation.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.