CODEWITHSUNDEEP
geometryintegerbeziercurvequadratic
starmole
starmole

Reputation: 994

Fast Method to Intersect two Integer Quadratic Beziers?

Given two Quadratic Beziers in 2D with integer coordinates, what is the best way to find their intersection point(s)? Also interesting is an early rejection if they do not intersect. If it makes it easier, they can both be assumed to be monotone in both x and y. Only intersections that are representable by subdivision to integers of the input curves are valid.

Upvotes: 3

Views: 1794

Answers (2)

Matthias Hoefs
Matthias Hoefs

Reputation: 1

Nope, that doesn't work. This way, you'll only find a small (usually empty) subset of the intersections between Q1 and Q2, namely those where the intersection points lay at the same curve parameter t with respect to both curves involved.

Upvotes: 0

strager
strager

Reputation: 90042

This document explains various methods for finding the intersection of curves.

Upvotes: 3

Related Questions