Quoting Jasper van de Gronde <th.v.d.gronde@...528...>:

Another option would be to let the intersection of a group and a path do something more interesting than complain that one of the objects isn't a path. I'd say it would be pretty intuitive if the intersection of a path and a group would yield a group containing the intersections of all objects in the group and the path. Most other operations would also seem reasonable to me.

Hmm, I can definitely see that making sense for difference and maybe intersection. I'm not _quite_ sure what the expected result for union should be though.

Still, I like the idea. Anyone up for implementing?

-mental