-
-
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
Full convexity #1594
Full convexity #1594
Conversation
…s and CellGeometry::addCellsTouchingPoints
…lySubconvex on segment are 3 times faster
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.
Last batch, thx
Co-authored-by: David Coeurjolly <[email protected]>
Co-authored-by: David Coeurjolly <[email protected]>
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.
Just a couple of minor questions. Otherwise, no more comments, thx
Should be fine now. |
Great, thx |
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.
All good
PR Description
This PR completes the module on Digital Convexity with new functions related to full convexity. In particular, it provides an algorithm to check full convexity for arbitrary digital sets in nD, and proposes several helper classes for using full convexity in practice: one dedicated to local geometric analysis, the other devoted to tangency and shortest paths.
Checklist
cmake
mode (otherwise, Travis C.I. will fail).