OilfieldToolsNet/opm-common
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

initialize variables

Browse Source
This commit is contained in:
Arne Morten Kvarving 2023-06-01 09:37:22 +02:00
parent 19f103db9b
commit 5ab4c3dfa0
2 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
external/resinsight/LibGeometry/cvfRay.cpp vendored
View File

@ -283,7 +283,7 @@ bool Ray::boxIntersect(const BoundingBox& box, Vec3d* intersectionPoint) const
// Find candidate planes; this loop can be avoided if rays cast all from the eye(assume perpsective view) // Find candidate planes; this loop can be avoided if rays cast all from the eye(assume perpsective view)
bool inside = true; bool inside = true;
char quadrant[3]; char quadrant[3]{};
double candidatePlane[3] = {0.0, 0.0, 0.0}; double candidatePlane[3] = {0.0, 0.0, 0.0};
Vec3d min = box.min(); Vec3d min = box.min();
@ -320,17 +320,13 @@ bool Ray::boxIntersect(const BoundingBox& box, Vec3d* intersectionPoint) const
} }
// Calculate T distances to candidate planes // Calculate T distances to candidate planes
double maxT[3]; double maxT[3]{-1.0f, -1.0f, -1.0f};
for (i = 0; i < 3; i++) for (i = 0; i < 3; i++)
{ {
if (quadrant[i] != MIDDLE && m_direction[i] !=0.0f) if (quadrant[i] != MIDDLE && m_direction[i] !=0.0f)
{ {
maxT[i] = (candidatePlane[i] - m_origin[i]) / m_direction[i]; maxT[i] = (candidatePlane[i] - m_origin[i]) / m_direction[i];
} }
else
{
maxT[i] = -1.0f;
}
} }
// Get largest of the maxT's for final choice of intersection // Get largest of the maxT's for final choice of intersection

2
external/resinsight/cafHexGridIntersectionTools/cafHexGridIntersectionTools.cpp vendored
View File

@ -1084,7 +1084,7 @@ int HexGridIntersectionTools::planeHexIntersectionMC( const cvf::Plane& plane
} }
cvf::Vec3d edgeIntersections[12]; cvf::Vec3d edgeIntersections[12];
double normDistAlongEdge[12]; double normDistAlongEdge[12]{};
// Compute vertex coordinates on the edges where we have intersections // Compute vertex coordinates on the edges where we have intersections
if ( cubeIdxToCutEdgeBitfield[cubeIndex] & 1 ) if ( cubeIdxToCutEdgeBitfield[cubeIndex] & 1 )