-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPoissonDiscSamping.cs
75 lines (69 loc) · 3.01 KB
/
PoissonDiscSamping.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
using System.Collections;
using System.Collections.Generic;
using UnityEngine;
public static class PoissonDiscSamping
{
public static List<Vector2> GeneratePoint(Vector2 position,Vector2 sampleRegionSize,float radius,int rejectionCount = 30)
{
float cellSize = radius / Mathf.Sqrt(2);
Vector2 offset = new Vector2(sampleRegionSize.x * 0.5f, sampleRegionSize.y * 0.5f);
int[,] grid = new int[Mathf.CeilToInt(sampleRegionSize.x / cellSize), Mathf.CeilToInt(sampleRegionSize.y / cellSize)];
List<Vector2> points = new List<Vector2>();
List<Vector2> spawnPoints = new List<Vector2>();
spawnPoints.Add(sampleRegionSize / 2);
while (spawnPoints.Count > 0)
{
int index = Random.Range(0, spawnPoints.Count);
Vector2 randomSpawn = spawnPoints[index];
bool candidateAccepted = false;
for (int i = 0; i < rejectionCount; i++)
{
float angle = Random.value * Mathf.PI * 2;
Vector2 dir = new Vector2(Mathf.Sin(angle), Mathf.Cos(angle));
Vector2 candidate = randomSpawn + dir * Random.Range(radius, 2 * radius);
if (IsValid(candidate, sampleRegionSize, cellSize, radius, points, grid))
{
points.Add(candidate);
spawnPoints.Add(candidate);
grid[(int)(candidate.x / cellSize), (int)(candidate.y / cellSize)] = points.Count;
candidateAccepted = true;
break;
}
}
if (!candidateAccepted)
{
spawnPoints.RemoveAt(index);
}
}
return points;
}
static bool IsValid(Vector2 candidate, Vector2 sampleRegionSize, float cellSize, float radius, List<Vector2> points, int[,] grid)
{
if (candidate.x >= 0 && candidate.x < sampleRegionSize.x && candidate.y >= 0 && candidate.y < sampleRegionSize.y)
{
int cellX = (int)(candidate.x / cellSize);
int cellY = (int)(candidate.y / cellSize);
int searchStartX = Mathf.Max(0, cellX - 2);
int searchEndX = Mathf.Min(cellX + 2, grid.GetLength(0) - 1);
int searchStartY = Mathf.Max(0, cellY - 2);
int searchEndY = Mathf.Min(cellY + 2, grid.GetLength(1) - 1);
for (int x = searchStartX; x <= searchEndX; x++)
{
for (int y = searchStartY; y <= searchEndY; y++)
{
int pointIndex = grid[x, y] - 1;
if (pointIndex != -1)
{
float sqrDst = (candidate - points[pointIndex]).sqrMagnitude;
if (sqrDst < radius * radius)
{
return false;
}
}
}
}
return true;
}
return false;
}
}