Geometric Intersection#10
Merged
Merged
Conversation
videlec
force-pushed
the
geometric-intersection
branch
from
a72e941 to
eff8b39
Compare
Open
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Implement the geometric intersection of curve systems (given as a list of walks) on surfaces with a single vertex and all face punctured. The implementation runs in O(log(g) * len(walks)) and uses heavily word combinatorics in the free group.
The generalization to other surfaces (more vertices or some unpuctured faces) will be dealt with in subsequent PR.