Hi.

I need some hints and hope somebody could help me.

I'm looking for two funtions for 2d cubic (Beziér) splines.

1) a "Hittest" (or: distance of a given point to nearest point on a beziér)
2) is a bounding box around a bezier courve.

I could think of a solution like walking along the bezier by splitting it at a given percentage, but thats ineffective and inexact.

Any better ideas or does anybody know some "off-the-shelf" algorithms ?



There's a third thing that is of interest for me, but not that important: Creating points that make up the bezier spline in a way, that the distance of the points is identical (e.g. point distance of 0.1 mm) that is not using recursive approaches or that are at least terminating after a deterministic time.