You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to geometr...@moderators.isc.org
I have a scene composed of lots of polygons, many of which overlap. I wish to divide the scene into individual areas illuminated. To do this I will have to find all the intersection polygons and remainder polygons.
How do I go about this? Is there a web site that explains the best algorithms? Has anyone had to do similar?