Skip to content

Optimize intersection feature for Quadratic Bezier curves #217

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
Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Optimize intersection feature for Quadratic Bezier curves #217

wants to merge 3 commits into from

Conversation

@rBazan98
Copy link

@rBazan98 rBazan98 commented Nov 19, 2023 •
edited
Loading

This approach determines intersections of two Quadratic Bezier curves by directly solving the parametric equations for Cartesian coordinates associated with each Bezier curve instead of finding intersections by interpolation.

Notation used is as follows:

  • 'xn' and 'yn' represents coordinates of each control points 0, 1, and 2.
  • Parametric forms of coordinates used: X = At^2 + Bt + x0 and Y = Ct^2 + Dt + y0.
  • Equation at^4 + bt^3 + ct^2 + d = 0 identifies intersections as roots.
@rBazan98
Optimize intersection feature for Quadratic Bezier curves
92eac2c 
Optimization made by solving the parametric ecuation of both quadratic bezier curves
@rBazan98
fix trailing whitespace
e214b03
@rBazan98
fix trailing whitespace
ee12eeb
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

1 participant

@rBazan98