[metapost] Re: all intersections between two paths

[Boguslaw Jackowski]

I asked Dan:
> Dan Luecking:
>> Mathematically, paths of length 1 can intersect as many as 9 times.
>
> Could you provide an example? I can invent only an 8 intersections case.

Here is the example:

beginfig(100);
 path p,q;
 size:=100;
 p:=(0,0).. controls (300,100) and (-200,100) .. (100,0);
 q:=p rotatedaround (center(p), 100) shifted (-5,5);
 draw p; draw q;
endfig;

;-)

-- Jacko

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
 Bogus\l{}aw Jackowski: B_Jackowski at GUST.ORG.PL
----------------------------------------------------------------
 Hofstadter's Law: It always takes longer than you expect, even
                   when you take into account Hofstadter's Law.
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-