Bezier Curves

Find all points where a system of bezier curves intersect

Create an optimization algorithm that readjusts all bezier curves in the system to minimize intersections while maintaining start and end points.

An area is closed by two bezier curves and a line from startpoint to startpoint  and a line from end point to end point. Minimize this area while maximizing the distance between the curves.

Has anyone worked on something like this? Are there ready made/well known algorithms to work with bezier curves like this?

An area is closed by two bezier curves and a line from startpoint to startpoint  and a line from end point to end point. Minimize this area while maximizing the distance between the curves.

Sounds like a job for calculus!

The jews are after me.

well for the first one it doesnt look like a general analytical solution exists but you have to break the line down into boxes and detect clipping over small areas. theres a few other algorithms but they're all numerical. we need more jew programmers to figure this stuff out.

b d
∫ ∫ f(x,y)-g(x,y) dx dy
 a c