Perl Monk, Perl Meditation | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
You should describe the format of your polygon data, to avoid us guessing.
In general many efficient so called "clipping" algorithms depend on calculating "bounding boxes". This - the smallest surrounding rectangular - allows eliminating many impossible candidates. The rules are:
Thus storing the bounding-boxes in an ordered structure° helps efficiently eliminating impossible combinations. But I suppose you are better off using an already available graphic lib. HTH! :)
Cheers Rolf
update°) see also Spatial_index#Spatial_index and for instance Quadtree In reply to Re: searching polygons not merged
by LanX
|
|