kaze/orx
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix poissonDiskSampling signature change in demos (#225)

Browse Source
This commit is contained in:
Abe Pazos
2022-02-28 21:02:26 +01:00
committed by GitHub
parent b9779bb821
commit 299bebfe89
4 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
orx-jvm/orx-triangulation/src/demo/kotlin/DemoDelaunay01.kt
View File

@@ -22,7 +22,7 @@ fun main() {
val circle = Circle(Vector2(400.0), 250.0)
val points = poissonDiskSampling(width * 1.0, height * 1.0, 30.0)
val points = poissonDiskSampling(drawer.bounds, 30.0)
.filter { circle.contains(it) }
val delaunay = Delaunay.from(points + circle.contour.equidistantPositions(40))

2
orx-jvm/orx-triangulation/src/demo/kotlin/DemoDelaunay02.kt
View File

@@ -21,7 +21,7 @@ fun main() {
val frame = Rectangle.fromCenter(Vector2(400.0), 600.0, 600.0)
val points = poissonDiskSampling(frame.width, frame.height, 50.0).map { it + frame.corner }
val points = poissonDiskSampling(frame, 50.0).map { it + frame.corner }
val delaunay = Delaunay.from(points)
val halfedges = delaunay.halfedges()

2
orx-jvm/orx-triangulation/src/demo/kotlin/DemoVoronoi01.kt
View File

@@ -23,7 +23,7 @@ fun main() {
val circle = Circle(Vector2(400.0), 250.0)
val frame = Rectangle.fromCenter(Vector2(400.0), 600.0, 600.0)
val points = poissonDiskSampling(width * 1.0, height * 1.0, 30.0)
val points = poissonDiskSampling(drawer.bounds, 30.0)
.filter { circle.contains(it) }
val delaunay = Delaunay.from(points + circle.contour.equidistantPositions(40))

3
orx-noise/src/commonMain/kotlin/PoissonDisk.kt
View File

@@ -20,11 +20,12 @@ internal const val epsilon = 0.0000001
* They can also be generated on a ring like in the original algorithm from Robert Bridson
*
* @param bounds the rectangular bounds of the area to generate points in
* @param r the minimum distance between each point
* @param radius the minimum distance between each point
* @param tries number of candidates per point
* @param randomOnRing generate random points on a ring with an annulus from r to 2r
* @param random a random number generator, default value is [Random.Default]
* @param initialPoints a list of points in sampler space, these points will not be tested against [r]
* @param obstacleHashGrids a list of obstacles to avoid, defined by points and radii
* @param boundsMapper a custom function to check if a point is within bounds
* @return a list of points