Cubic intersection experimental branch #258
Draft
Conversation
This file contains 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
A bunch of stuff toward cubic/cubic intersection.
Still prototype code, but it prints an intersection.
First step: apply min/max logic to existing parabola estimates. This may keep subdividing, so the next step will be a Frechet based bound. WIP, just the min/max estimates.
raphlinus
force-pushed
the
cubic_intersect
branch
from
9342992
to
1f86c26
Compare
|
I realize I had pushed the wrong branch. This is still quite messy (and should probably be replaced with a cleaner commit), but in any case, the interesting logic is in |
|
I recently discovered there is actually an algebraic closed-form solution for cubic-cubic intersection! "All" you have to do is construct a Sturm sequence and solve a 9th-degree polynomial. Easy, really. There's an implementation here. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
A prototype of a cubic/cubic intersection algorithm. The core of this produces better results than the "fat line" technique (see #199), but it's not made fully robust and is not wired up with a usable API. This draft PR just snapshots work in progress and hopefully is a step toward a real solution.