On 07/02/2010 07:01 PM, Marco wrote:
Hi,
two arbitrary paths are given. A small path and a larger path, both cycled.
How to find out if the smaller path lies completely »inside« the larger path?
That is hard. The main problem is the word 'arbitrary'. An arbitrary
path does not even have to enclose anything:
path p; p = origin--(100,100)--cycle;
If this is too complicated, it might help if I can find out if a given point
lies inside a given cycled path.
Even this is fairly tricky. Some important questions are:
* do your arbitrary paths selfintersect?
* are your arbitrary paths convex or concave?
* is a point *on* the path in or out?
* do you want to use nonzero or even-odd filling rules?
Best wishes,
Taco
___________________________________________________________________________________
If your question is of interest to others as well, please add an entry to the
Wiki!
maillist : [email protected] / http://www.ntg.nl/mailman/listinfo/ntg-context
webpage : http://www.pragma-ade.nl / http://tex.aanhet.net
archive : http://foundry.supelec.fr/projects/contextrev/
wiki : http://contextgarden.net
___________________________________________________________________________________
