star-uvm

commit fa6104395702ed57a162490fd6152d2e0b43077f
parent c9f64569681925291c006240886cd577cb683e25
Author: Vincent Forest <vincent.forest@meso-star.com>
Date:   Thu, 10 Dec 2020 10:10:25 +0100

Fix a comment

Diffstat:
M
src/suvm_volume_intersect_aabb.c
 | 
10
++++------

1 file changed, 4 insertions(+), 6 deletions(-)
diff --git a/src/suvm_volume_intersect_aabb.c b/src/suvm_volume_intersect_aabb.c
@@ -218,12 +218,10 @@ tetrahedron_setup
   }
 }
 
-/* Define if an axis aligned bounding box and a tetrahedron are intersected.
- * Its implementation follows the algorithms proposed by N. Green in "Detecting
- * intersection of a rectangular solid and a convex polyhedron" (Graphics Gems
- * IV, 1994, p74--82) and by H. Ratschek and J. Rokne in "Test for intersection
- * between box and tetrahedron" (Internation Journal of Computer Mathematics,
- * 1997, p191--204) */
+/* Define if an axis aligned bounding box and a tetrahedron are intersecting.
+ * Its implementation follows the algorithms proposed by N. Greene in
+ * "Detecting intersection of a rectangular solid and a convex polyhedron"
+ * (Graphics Gems IV, 1994, p74--82) */
 static INLINE int
 aabb_intersect_tetrahedron
   (const float low[3],