Intersecting path p and q will give you more or less randomly (actually, there is an algorithm, but not a very useful one for METAPOST) an intersection (time on p, time on q) I am trying to find out if anybody as already created a macro that gives you the intersection with the smallest (or largest) time on p. Probably requires finding all the intersections and then returning either the point on p with minimum (or maximum) t. Before writing myself, maybe someone already has this, in which case thanks in advance. G