You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
opened by Joseph Weston (@jbweston) at 2018-07-10T15:35:28.517Z
Currently we test against the standard simplex.
We could improve matters by applying a random affine transform to the standard simplex, and checking that the tests still pass.
We would also need to have functions for generating points around simplices (inside, outside, on face). This should not be too hard.
For example we can generate points on a face by choosing ndim positive random numbers from successively smaller intervals, and then choosing a final number so that the sum is 1. These are the coordinates of a point in a simplex in the basis of the vertex vectors.
The text was updated successfully, but these errors were encountered:
originally posted by Jorn Hoofwijk (@Jorn) at 2018-07-13T07:48:30.616Z on GitLab
Joe and I discussed this yesterday (in real life), we made the tests stronger, with all possible special points (like on an edge, collinear with an edge, coplanar with a face, on a face, inside and outside, etcetera) and instead removed some randomness to make the tests easier to understand.
I do see that applying a transform could be interesting to do, but then for each case we should watch out that it is actually still correct, because a triangulation may change when scaling x and y with different factors.
(original issue on GitLab)
opened by Joseph Weston (@jbweston) at 2018-07-10T15:35:28.517Z
Currently we test against the standard simplex.
We could improve matters by applying a random affine transform to the standard simplex, and checking that the tests still pass.
We would also need to have functions for generating points around simplices (inside, outside, on face). This should not be too hard.
For example we can generate points on a face by choosing
ndim
positive random numbers from successively smaller intervals, and then choosing a final number so that the sum is 1. These are the coordinates of a point in a simplex in the basis of the vertex vectors.The text was updated successfully, but these errors were encountered: