theChosenOne
theChosenOne
I don’t take offence no. But you must realise that this library is a library. These aren’t hacks, they are designed to allow svgjs to be extensible and compose-able, these...
You effectively just want to check for bounding box intersections as far as I can tell here. But as @Fuzzyma said, you'd have to take into account the fact that...
Well thats not true is it? Because in the pseudocode I wrote; only the highest element in the tree that is fully enclosed by the box is selected. So applying...
I do agree that all of this is already available in rBox, except `enclosing, smallest, largest, path`. Now I would like to check my understanding of what you're proposing before...
@wout Have we captured your original intention here? If not, could you clarify what these extra properties should do.
So we want input on this, from everyone... if you have a particular calculation you want done; let us know :D
Oh awesome. Well it should be easy enough to add this sort of thing in. Seems like a pythagorus to me :P
Okay, lets throw it back in the milestone. I don't think it will take me too long to implement
Yea, I agree on that front. Its probably not the highest priority. But it could be cool. Not sure there.
looks like this won't make 3.0, but hopefully 3.1