star-3d

Surface structuring for efficient 3D geometric queries
git clone git://git.meso-star.fr/star-3d.git
Log | Files | Refs | README | LICENSE

commit 419fd93ddcbbb5d3df7832d5bcdcabb8176c42ee
parent 580ffcfdc63b73d12f1987e96dce961ca2a05c6e
Author: Vincent Forest <vincent.forest@meso-star.com>
Date:   Thu, 23 Jul 2020 11:26:09 +0200

Fix comments

Diffstat:
Msrc/s3d.h | 2+-
Msrc/test_s3d_closest_point.c | 4++--
2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/s3d.h b/src/s3d.h @@ -207,7 +207,7 @@ static const struct s3d_accel_struct_conf S3D_ACCEL_STRUCT_CONF_DEFAULT = /* Filter function data type. One can define such function to discard * intersections along a ray or the result of a closest point query with * respect to user defined criteria, e.g.: masked/transparent primitive, etc. - * Return 0 or the intersection is not discarded and a value not equal to zero + * Return 0 if or the intersection is not discarded and a value not equal to zero * otherwise. */ typedef int (*s3d_hit_filter_function_T) diff --git a/src/test_s3d_closest_point.c b/src/test_s3d_closest_point.c @@ -749,7 +749,7 @@ test_cbox(struct s3d_device* dev) /* Check closest point query on Cornell box */ FOR_EACH(i, 0, 10000) { /* Randomly generate a point in a bounding box that is 2 times the size of - * the triangle AABB */ + * the cornell box AABB */ pos[0] = mid[0] + (rand_canonic() * 2 - 1) * (upp[0] - low[0]); pos[1] = mid[1] + (rand_canonic() * 2 - 1) * (upp[1] - low[1]); pos[2] = mid[2] + (rand_canonic() * 2 - 1) * (upp[2] - low[2]); @@ -768,7 +768,7 @@ test_cbox(struct s3d_device* dev) /* Check closest point query filtering */ FOR_EACH(i, 0, 10000) { /* Randomly generate a point in a bounding box that is 2 times the size of - * the triangle AABB */ + * the cornell box AABB */ pos[0] = mid[0] + (rand_canonic() * 2 - 1) * (upp[0] - low[0]); pos[1] = mid[1] + (rand_canonic() * 2 - 1) * (upp[1] - low[1]); pos[2] = mid[2] + (rand_canonic() * 2 - 1) * (upp[2] - low[2]);