On 2009-11-08 3:42 AM, Jeff Schiller wrote: > All of this discussion misses the fact that we are not hit-testing a > point, we have to hit-test a rectangle for checkIntersection. This > means we really need to determine if the sides of the rectangle > intersect any shape's fill or stroke depending on the value of > pointer-events on that shape. Doesn't that make it a totally different > algorithm altogether? Note that interpreting "intersects" as "intersects the sides of" would imply that getIntersectionList only returns elements that actually intersect the perimeter of the given rectangle - NOT elements that are fully inside the rectangle. JonathanReceived on Thursday, 19 November 2009 17:30:46 GMT
This archive was generated by hypermail 2.3.1 : Friday, 8 March 2013 15:54:43 GMT