Regalis11
334 lines
10 KiB
C#
334 lines
10 KiB
C#
/*
|
|
* Created by SharpDevelop.
|
|
* User: Burhan
|
|
* Date: 17/06/2014
|
|
* Time: 09:29 م
|
|
*
|
|
* To change this template use Tools | Options | Coding | Edit Standard Headers.
|
|
*/
|
|
|
|
/*
|
|
Copyright 2011 James Humphreys. All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification, are
|
|
permitted provided that the following conditions are met:
|
|
|
|
1. Redistributions of source code must retain the above copyright notice, this list of
|
|
conditions and the following disclaimer.
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
of conditions and the following disclaimer in the documentation and/or other materials
|
|
provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY James Humphreys ``AS IS\" AND ANY EXPRESS OR IMPLIED
|
|
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> OR
|
|
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
The views and conclusions contained in the software and documentation are those of the
|
|
authors and should not be interpreted as representing official policies, either expressed
|
|
or implied, of James Humphreys.
|
|
*/
|
|
|
|
/*
|
|
* C# Version by Burhan Joukhadar
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
* purpose without fee is hereby granted, provided that this entire notice
|
|
* is included in all copies of any software which is or includes a copy
|
|
* or modification of this software and in all copies of the supporting
|
|
* documentation for such software.
|
|
* THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
|
|
* WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR AT&T MAKE ANY
|
|
* REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
|
|
* OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
|
|
*/
|
|
|
|
|
|
using Barotrauma;
|
|
using FarseerPhysics.Dynamics;
|
|
using Microsoft.Xna.Framework;
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
|
|
namespace Voronoi2
|
|
{
|
|
public class DoubleVector2
|
|
{
|
|
public double X, Y;
|
|
|
|
public DoubleVector2()
|
|
{
|
|
}
|
|
|
|
public DoubleVector2(double x, double y)
|
|
{
|
|
this.X = x;
|
|
this.Y = y;
|
|
}
|
|
|
|
public void SetPoint(double x, double y)
|
|
{
|
|
this.X = x;
|
|
this.Y = y;
|
|
}
|
|
|
|
public void Normalize()
|
|
{
|
|
double length = System.Math.Sqrt(X * X + Y * Y);
|
|
X /= length;
|
|
Y /= length;
|
|
}
|
|
}
|
|
|
|
// use for sites and vertecies
|
|
public class Site
|
|
{
|
|
public DoubleVector2 Coord;
|
|
public int SiteNbr;
|
|
|
|
public void SetPoint(Vector2 point)
|
|
{
|
|
Coord.SetPoint(point.X, point.Y);
|
|
}
|
|
|
|
public Site ()
|
|
{
|
|
Coord = new DoubleVector2();
|
|
}
|
|
}
|
|
|
|
public class Edge
|
|
{
|
|
public double a = 0, b = 0, c = 0;
|
|
public Site[] ep;
|
|
public Site[] reg;
|
|
public int edgenbr;
|
|
|
|
public Edge ()
|
|
{
|
|
ep = new Site[2];
|
|
reg = new Site[2];
|
|
}
|
|
}
|
|
|
|
|
|
public class Halfedge
|
|
{
|
|
public Halfedge ELleft, ELright;
|
|
public Edge ELedge;
|
|
public bool deleted;
|
|
public int ELpm;
|
|
public Site vertex;
|
|
public double ystar;
|
|
public Halfedge PQnext;
|
|
|
|
public Halfedge ()
|
|
{
|
|
PQnext = null;
|
|
}
|
|
}
|
|
|
|
public enum CellType
|
|
{
|
|
Solid, Empty, Path, Removed
|
|
}
|
|
|
|
public class VoronoiCell
|
|
{
|
|
public List<GraphEdge> Edges;
|
|
public Site Site;
|
|
|
|
public List<Vector2> BodyVertices;
|
|
|
|
public Body Body;
|
|
|
|
public CellType CellType;
|
|
|
|
public Vector2 Translation;
|
|
|
|
public bool Island;
|
|
|
|
public bool IsDestructible;
|
|
public bool DoesDamage;
|
|
|
|
/// <summary>
|
|
/// Executed when the cell is destroyed (only applies to destructible level walls)
|
|
/// </summary>
|
|
public Action OnDestroyed;
|
|
|
|
public Vector2 Center
|
|
{
|
|
get { return new Vector2((float)Site.Coord.X, (float)Site.Coord.Y) + Translation; }
|
|
}
|
|
|
|
public VoronoiCell(Vector2[] vertices)
|
|
{
|
|
Edges = new List<GraphEdge>();
|
|
BodyVertices = new List<Vector2>();
|
|
|
|
Vector2 midPoint = Vector2.Zero;
|
|
foreach (Vector2 vertex in vertices)
|
|
{
|
|
midPoint += vertex;
|
|
}
|
|
midPoint /= vertices.Length;
|
|
|
|
for (int i = 0; i < vertices.Length; i++)
|
|
{
|
|
GraphEdge ge = new GraphEdge(vertices[i], vertices[MathUtils.PositiveModulo(i + 1, vertices.Length)]);
|
|
System.Diagnostics.Debug.Assert(ge.Point1 != ge.Point2);
|
|
Edges.Add(ge);
|
|
}
|
|
|
|
Site = new Site();
|
|
Site.SetPoint(midPoint);
|
|
}
|
|
|
|
public VoronoiCell(Site site)
|
|
{
|
|
Edges = new List<GraphEdge>();
|
|
BodyVertices = new List<Vector2>();
|
|
//bodies = new List<Body>();
|
|
this.Site = site;
|
|
}
|
|
|
|
public bool IsPointInside(Vector2 point)
|
|
{
|
|
if (!IsPointInsideAABB(point, margin: 0.0f)) { return false; }
|
|
Vector2 transformedPoint = point - Translation;
|
|
foreach (GraphEdge edge in Edges)
|
|
{
|
|
if (MathUtils.LineSegmentsIntersect(transformedPoint, Center - Translation, edge.Point1, edge.Point2)) { return false; }
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public bool IsPointInsideAABB(Vector2 point2, float margin)
|
|
{
|
|
// Note: Previously used Linq.All() queries, which were simpler and more readable, but based on DPA, this caused major memory allocations due to captured variables in the lambdas, as the method is used a lot when generating levels.
|
|
// So the code was refactored to use a custom local implementation instead.
|
|
Vector2 transformedPoint = point2 - Translation;
|
|
Vector2 max = transformedPoint + Vector2.One * margin;
|
|
Vector2 min = transformedPoint - Vector2.One * margin;
|
|
if (AllOutsideBounds(static (e, t) => e.Point1.X < t && e.Point2.X < t, bounds: min.X)) { return false; }
|
|
if (AllOutsideBounds(static (e, t) => e.Point1.Y < t && e.Point2.Y < t, bounds: min.Y)) { return false; }
|
|
if (AllOutsideBounds(static (e, t) => e.Point1.X > t && e.Point2.X > t, bounds: max.X)) { return false; }
|
|
if (AllOutsideBounds(static (e, t) => e.Point1.Y > t && e.Point2.Y > t, bounds: max.Y)) { return false; }
|
|
return true;
|
|
|
|
bool AllOutsideBounds(Func<GraphEdge, float, bool> predicate, float bounds)
|
|
{
|
|
foreach (GraphEdge edge in Edges)
|
|
{
|
|
if (!predicate(edge, bounds))
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
|
|
public void GetBounds(out Vector2 min, out Vector2 max)
|
|
{
|
|
min = Center;
|
|
max = Center;
|
|
foreach (GraphEdge edge in Edges)
|
|
{
|
|
min = new Vector2(Math.Min(edge.Point1.X, min.X), Math.Min(edge.Point1.Y, min.Y));
|
|
min = new Vector2(Math.Min(edge.Point2.X, min.X), Math.Min(edge.Point2.Y, min.Y));
|
|
max = new Vector2(Math.Max(edge.Point1.X, max.X), Math.Max(edge.Point1.Y, max.Y));
|
|
max = new Vector2(Math.Max(edge.Point2.X, max.X), Math.Max(edge.Point2.Y, max.Y));
|
|
}
|
|
}
|
|
}
|
|
|
|
public class GraphEdge
|
|
{
|
|
public Vector2 Point1, Point2;
|
|
public Site Site1, Site2;
|
|
public VoronoiCell Cell1, Cell2;
|
|
|
|
public bool IsSolid;
|
|
public bool OutsideLevel;
|
|
public bool NextToCave, NextToMainPath, NextToSidePath;
|
|
|
|
public Vector2 Center
|
|
{
|
|
get { return (Point1 + Point2) / 2.0f; }
|
|
}
|
|
|
|
public float Length => Vector2.Distance(Point1, Point2);
|
|
|
|
public GraphEdge(Vector2 point1, Vector2 point2)
|
|
{
|
|
this.Point1 = point1;
|
|
this.Point2 = point2;
|
|
}
|
|
|
|
public VoronoiCell AdjacentCell(VoronoiCell cell)
|
|
{
|
|
if (Cell1 == cell)
|
|
{
|
|
return Cell2;
|
|
}
|
|
else if (Cell2 == cell)
|
|
{
|
|
return Cell1;
|
|
}
|
|
|
|
return null;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns the normal of the edge that points outwards from the specified cell
|
|
/// </summary>
|
|
public Vector2 GetNormal(VoronoiCell cell)
|
|
{
|
|
return GetNormal(cell, Point1, Point2);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Returns the normal of the edge between point1 to point2 that points outwards from the specified cell
|
|
/// </summary>
|
|
public static Vector2 GetNormal(VoronoiCell cell, Vector2 point1, Vector2 point2)
|
|
{
|
|
Vector2 center = (point1 + point2) / 2;
|
|
Vector2 dir = Vector2.Normalize(point1 - point2);
|
|
Vector2 normal = new Vector2(dir.Y, -dir.X);
|
|
if (cell != null && Vector2.Dot(normal, Vector2.Normalize(center - (cell.Center - cell.Translation))) < 0)
|
|
{
|
|
normal = -normal;
|
|
}
|
|
return normal;
|
|
}
|
|
|
|
public override string ToString()
|
|
{
|
|
return "GraphEdge (" + Point1.ToString() + ", " + Point2.ToString() + ")";
|
|
}
|
|
}
|
|
|
|
// للترتيب
|
|
public class SiteSorterYX : IComparer<Site>
|
|
{
|
|
public int Compare ( Site p1, Site p2 )
|
|
{
|
|
DoubleVector2 s1 = p1.Coord;
|
|
DoubleVector2 s2 = p2.Coord;
|
|
if ( s1.Y < s2.Y ) return -1;
|
|
if ( s1.Y > s2.Y ) return 1;
|
|
if ( s1.X < s2.X ) return -1;
|
|
if ( s1.X > s2.X ) return 1;
|
|
return 0;
|
|
}
|
|
}
|
|
}
|