Merge pull request NVIDIA#24 from ingowald/infinity-warning

Merge of PR NVIDIA#24, with some minor compile fix and cleanup. Looking good, CI looking good - thx!

Author: iwald-nvidia

cuBQL/queries/pointData/findClosest.h

@@ -46,7 +46,7 @@ namespace cuBQL {
                     /*! square of the maximum query distance in which
                       this query is to look for candidates. note
                       this is the SQUARE distance */
-                    float squareOfMaxQueryDistance=INFINITY);
+                    float squareOfMaxQueryDistance=PosInfTy());
 
     /*! given a (W-wide) bvh build over a set of float<N> points,
       perform a closest-point query that returns the index of the
@@ -77,7 +77,7 @@ namespace cuBQL {
                     /*! square of the maximum query distance in which
                       this query is to look for candidates. note
                       this is the SQUARE distance */
-                    float squareOfMaxQueryDistance=INFINITY);
+                    float squareOfMaxQueryDistance=PosInfTy());
 
 
     template<typename T, int D>
@@ -95,7 +95,7 @@ namespace cuBQL {
                              /*! square of the maximum query distance in which
                                this query is to look for candidates. note
                                this is the SQUARE distance */
-                             float squareOfMaxQueryDistance=INFINITY);
+                             float squareOfMaxQueryDistance=PosInfTy());
 
     template<typename T, int D>
     /*! same as regular points::closestPoint, but excluding all data
@@ -112,7 +112,7 @@ namespace cuBQL {
                                /*! square of the maximum query distance in which
                                  this query is to look for candidates. note
                                  this is the SQUARE distance */
-                               float squareOfMaxQueryDistance=INFINITY);
+                               float squareOfMaxQueryDistance=PosInfTy());
 
 #ifdef __CUDACC__
     // ******************************************************************
@@ -128,7 +128,7 @@ namespace cuBQL {
                     /*! square of the maximum query distance in which
                       this query is to look for candidates. note
                       this is the SQUARE distance */
-                    float squareOfMaxQueryDistance=INFINITY);
+                    float squareOfMaxQueryDistance=PosInfTy());
 
     // ******************************************************************
     /*! variant of cuBQL::point::findClosest() that's specialized for
@@ -143,7 +143,7 @@ namespace cuBQL {
                     /*! square of the maximum query distance in which
                       this query is to look for candidates. note
                       this is the SQUARE distance */
-                    float squareOfMaxQueryDistance=INFINITY);
+                    float squareOfMaxQueryDistance=PosInfTy());
 
     // ******************************************************************
     /*! variant of cuBQL::point::findClosest() that's specialized for
@@ -158,7 +158,7 @@ namespace cuBQL {
                     /*! square of the maximum query distance in which
                       this query is to look for candidates. note
                       this is the SQUARE distance */
-                    float squareOfMaxQueryDistance=INFINITY);
+                    float squareOfMaxQueryDistance=PosInfTy());
 #endif
 
     // ******************************************************************
@@ -179,7 +179,7 @@ namespace cuBQL {
                                   /*! square of the maximum query distance in which
                                     this query is to look for candidates. note
                                     this is the SQUARE distance */
-                                  float squareOfMaxQueryDistance=INFINITY)
+                                  float squareOfMaxQueryDistance=PosInfTy())
     {
       int closestID = -1;
       float closestSqrDist = squareOfMaxQueryDistance;
@@ -227,7 +227,7 @@ namespace cuBQL {
                                   /*! square of the maximum query distance in which
                                     this query is to look for candidates. note
                                     this is the SQUARE distance */
-                                  float squareOfMaxQueryDistance=INFINITY)
+                                  float squareOfMaxQueryDistance=PosInfTy())
     {
       int closestID = -1;
       float closestSqrDist = squareOfMaxQueryDistance;

cuBQL/queries/pointData/knn.h

@@ -52,7 +52,7 @@ namespace cuBQL {
                                /*! square of the maximum query distance in which
                                  this query is to look for candidates. note
                                  this is the SQUARE distance */
-                               float squareOfMaxQueryDistance=INFINITY);
+                               float squareOfMaxQueryDistance=PosInfTy());
 
 
     // ******************************************************************

cuBQL/queries/triangleData/math/boxTriangleIntersections.h

@@ -85,7 +85,7 @@ namespace cuBQL {
            entirely within that slab (iff lower_k <= a_k <= upper_k),
            or entirely outside */
         if (a_k > upper_k || a_k < lower_k) {
-          t0 = INFINITY; t1 = -INFINITY;
+          t0 = PosInfTy(); t1 = NegInfTy();
         }
       } else {
         /* line segment is not parallel to the slab planes, so we can

cuBQL/queries/triangleData/math/pointToTriangleDistance.h

@@ -15,7 +15,7 @@ namespace cuBQL {
 
     struct PointToTriangleTestResult {
       /*! (square!) distance between query point and closest point on triangle.*/
-      float sqrDist = INFINITY;
+      float sqrDist = PosInfTy();
       /*! the actual 3D point that's closest on the triangle */
       vec3f P;
     };