[metapost] intersectiontimes peculiarity

[Boguslaw Jackowski]

Hi,

needless to say, the subject has appeared a few times on MP list. :-)

Attached is my proposal of finding all intersections (the time-order is 
forced by applying the quicksort method).

One must remember that in discrete geometry one cannot robustly tell 
tangent or almost tangent curves from intersecting ones. Given this 
reservation, the algorithm works quite nicely -- we use it in our engines 
generating fonts for many years.

Cheers -- Jacko

-- 
BOP s. c.
ul. Bora-Komorowskiego 24, 80-377 Gdansk, Poland
tel. (+48 58) 553 46 59,  fax (+48 58) 511 03 81
bop at bop.com.pl, http://www.bop.com.pl
-------------- next part --------------
A non-text attachment was scrubbed...
Name: INTERSECT.zip
Type: application/zip
Size: 5173 bytes
Desc: 
URL: <http://tug.org/pipermail/metapost/attachments/20130424/c248da56/attachment.zip>