Chris Denham wrote:
Question 2:
If, in a simple scene consisting of two non intersecting transparent triangles,
it is always possible to find a correct order to draw them, then what is the
algorithm that sorts them? Given that a single depth value for each triangle is
insufficent to determine the correct order, it feels like there ought to be a
simple geometric solution using all three vertices.
Unfortunately my maths head seems to be in the wash today.
If they're non-intersecting, then a BSP tree would always sort them
correctly. (BSP: Binary Space Partition, a plane separating the two
triangles. Draw order of the triangles is determined by the location of
the viewpoint relative to the plane.)
-Paul
_______________________________________________
osg-users mailing list
[email protected]
http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
