(triangulation) make method for finding initial simplex part of the triangulation class #68

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Closed

1 task

basnijholt opened this issue Dec 19, 2018 · 0 comments

Labels

Member

basnijholt commented Dec 19, 2018

(original issue on GitLab)

opened by Jorn Hoofwijk (@Jorn) at 2018-07-05T18:04:39.498Z

The following discussion from gitlab:!68 should be addressed:

@jbweston started a discussion: (+1 comment)

Could you explain what this function is meant to do?

The comment about taking a "random" (arbitrary) simplex does not seem to fit with the function name that says that we are finding the "initial simplex".

What is an "initial" simplex? Would it be correct to say that this finds an arbitrary simplex among the provided points? Does this simplex have to come from a delaunay triangulation, or is that an implementation detail?

basnijholt added the LearnerND label

basnijholt closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment