Skip to content

Commit

Permalink
Avoiding more numpy 2.0 deprecation warnings (#3049)
Browse files Browse the repository at this point in the history
  • Loading branch information
eepeterson authored Jun 20, 2024
1 parent 78ee851 commit 4bd0b09
Showing 1 changed file with 8 additions and 8 deletions.
16 changes: 8 additions & 8 deletions openmc/model/surface_composite.py
Original file line number Diff line number Diff line change
Expand Up @@ -972,19 +972,19 @@ def _validate_points(self, points):
# Check if polygon is self-intersecting by comparing edges pairwise
n = len(points)
for i in range(n):
p0 = points[i, :]
p1 = points[(i + 1) % n, :]
p0 = np.append(points[i, :], 0)
p1 = np.append(points[(i + 1) % n, :], 0)
for j in range(i + 1, n):
p2 = points[j, :]
p3 = points[(j + 1) % n, :]
p2 = np.append(points[j, :], 0)
p3 = np.append(points[(j + 1) % n, :], 0)
# Compute orientation of p0 wrt p2->p3 line segment
cp0 = np.cross(p3-p0, p2-p0)
cp0 = np.cross(p3-p0, p2-p0)[-1]
# Compute orientation of p1 wrt p2->p3 line segment
cp1 = np.cross(p3-p1, p2-p1)
cp1 = np.cross(p3-p1, p2-p1)[-1]
# Compute orientation of p2 wrt p0->p1 line segment
cp2 = np.cross(p1-p2, p0-p2)
cp2 = np.cross(p1-p2, p0-p2)[-1]
# Compute orientation of p3 wrt p0->p1 line segment
cp3 = np.cross(p1-p3, p0-p3)
cp3 = np.cross(p1-p3, p0-p3)[-1]

# Group cross products in an array and find out how many are 0
cross_products = np.array([[cp0, cp1], [cp2, cp3]])
Expand Down

0 comments on commit 4bd0b09

Please sign in to comment.