[metapost] Re: all intersections between two paths

[Boguslaw Jackowski]

Hi once again,

LF> I don't quite understand why you don't want your macros to process the
LF> `paths' until all of the resulting `paths' fulfill your two conditions.

I do want, but I don't know how to do it reliably. As you have seen, even the
question whether two curves touch each other cannot be reliably answered. In
general, I to not know how to deal efficiently and reliably with
infinitezimal artefacts. I can agree that my knowledge about discrete
geometry is insufficient. Still, I'd bet that: give me a ``universal''
MP/MF algorithm and I'll find you a counterexample...

Needless to say, if there existed a reliable criterion that would tell
naughty paths from tidy ones, I'd be happy. No idea whether such
a criterion exists. Frankly speaking, I doubt. But maybe I'm wrong.
Therefore I asked the question about such a criterion.

-- 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