Hi again, After thinking about it here is what I think the answer is. Let's say our polytope intersects two circles (or rectangles) A and B, each at two points A1, A2 and B1, B2
The center point of A1 and A2 is computed, denote by centerA12 The center point of B1 and B2 is computed, denote by centerB12 Then the distance is measured from centerA12, and centerB12 to the reference plane. By default the reference plane is "the last plane in teh polytope" - meaning, if the polytope is made out of 5 half-planes, the last one is the default reference plane (the last one, as the last one in the data structure the half-planes are stored). The polytope intersector then stores the nodes sorted by the distance as described above. Still need to understand what happens if one of the circles is completely inside the polytope, what is the order of such an object in the sorting scheme. Also, another question I was asking myself, was about duplicate reporting. Let's say I have a parent and a child node both at the same location. When the polytope intersector intersects both, are they reported as 2 different intersections (each having their own path, which is the same except of one node)? (I would say yes) Cheers, Ron ------------------ Read this topic online here: http://forum.openscenegraph.org/viewtopic.php?p=50330#50330 _______________________________________________ osg-users mailing list osg-users@lists.openscenegraph.org http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
