vlad.os/LuaCsForBarotraumaEP
0
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Faction Test v1.0.1.0

Browse Source
This commit is contained in:
Regalis11
2023-02-16 15:01:28 +02:00
parent caa5a2f762
commit 2c5a7923b0
309 changed files with 7502 additions and 4335 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Barotrauma/BarotraumaShared/SharedSource/ProcGen/VoronoiElements.cs
+15 -4
View File
@@ -201,17 +201,28 @@ namespace Voronoi2
public bool IsPointInside(Vector2 point)
{
if (!IsPointInsideAABB(point, margin: 0.0f)) { return false; }
Vector2 transformedPoint = point - Translation;
if (Edges.All(e => e.Point1.X < transformedPoint.X && e.Point2.X < transformedPoint.X)) { return false; }
if (Edges.All(e => e.Point1.Y < transformedPoint.Y && e.Point2.Y < transformedPoint.Y)) { return false; }
if (Edges.All(e => e.Point1.X > transformedPoint.X && e.Point2.X > transformedPoint.X)) { return false; }
if (Edges.All(e => e.Point1.Y > transformedPoint.Y && e.Point2.Y > transformedPoint.Y)) { return false; }
foreach (GraphEdge edge in Edges)
{
if (MathUtils.LinesIntersect(transformedPoint, Center - Translation, edge.Point1, edge.Point2)) { return false; }
}
return true;
}
public bool IsPointInsideAABB(Vector2 point2, float margin)
{
Vector2 transformedPoint = point2 - Translation;
Vector2 max = transformedPoint + Vector2.One * margin;
Vector2 min = transformedPoint - Vector2.One * margin;
if (Edges.All(e => e.Point1.X < min.X && e.Point2.X < min.X)) { return false; }
if (Edges.All(e => e.Point1.Y < min.Y && e.Point2.Y < min.Y)) { return false; }
if (Edges.All(e => e.Point1.X > max.X && e.Point2.X > max.X)) { return false; }
if (Edges.All(e => e.Point1.Y > max.Y && e.Point2.Y > max.Y)) { return false; }
return true;
}
}
public class GraphEdge