-
-
Notifications
You must be signed in to change notification settings - Fork 116
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.
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
P-convexity: another characterisation of full convexity #1736
Conversation
/builddoc |
The documentation is built. It will be available, after a few minutes, here: https://dgtal-team.github.io/doc-pr/pr1736/index.html |
/builddoc |
The documentation is built. It will be available, after a few minutes, here: https://dgtal-team.github.io/doc-pr/pr1736/index.html |
/builddoc |
The documentation is built. It will be available, after a few minutes, here: https://dgtal-team.github.io/doc-pr/pr1736/index.html |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Few minor suggestions. Nice PR
hi @JacquesOlivierLachaud there is still a couple of requests for this pr |
Should be good now ! |
PR Description
This PR provides an implementation of P-convexity, which is a recursive equivalent definition of full convexity. It is shown that it provides a faster way to compute full convexity than its morphological characterisation.
Checklist