[help-3dldf] Re: all intersections between two paths

[Boguslaw Jackowski]

BJ> I can agree that my knowledge about discrete
BJ> geometry is insufficient.
LF> I wasn't casting aspersions.

You weren't. My insufficient knowledge is just the fact ;-)

LF> I just think it's likely that breaking up `paths' that don't fulfill
LF> them until all of the resulting `paths' do would be a good way
LF> of handling the general case.

This is one of the possibilities I took into account. Intuitively, it
looked less promising than the other one, i.e., loosening constraints.
Anyway, needs re-thinking.

Cheers -- Jacko

Ps. Nelson, thanks for the interesting reference.

-- 
BOP s. c.
ul. Bora-Komorowskiego 24, 80-377 Gdansk, Poland
tel. (+48 58) 553 46 59,  fax (+48 58) 511 03 81
address@hidden, http://www.bop.com.pl