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

Remove .take() from demos and tests when using .sampleEquidistant() (#325)

Browse Source
This commit is contained in:
Abe Pazos
2024-01-22 07:03:20 +00:00
committed by GitHub
parent 06f11b6ad7
commit fbcdd222ef
6 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
orx-triangulation/src/commonTest/kotlin/TestDelaunay.kt
View File

@@ -59,7 +59,7 @@ class TestDelaunay {
@Test @Test
fun testNeighbors() { fun testNeighbors() {
val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20).take(20) val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20)
val d = Delaunay.from(c) val d = Delaunay.from(c)
for (j in c.indices) { for (j in c.indices) {
assertTrue(d.neighbors(j).toList().isNotEmpty()) assertTrue(d.neighbors(j).toList().isNotEmpty())

2
orx-triangulation/src/commonTest/kotlin/TestVoronoi.kt
View File

@@ -7,7 +7,7 @@ import kotlin.test.assertTrue
class TestVoronoi { class TestVoronoi {
@Test @Test
fun testNeighbors() { fun testNeighbors() {
val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20).take(20) val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20)
val d = Delaunay.from(c) val d = Delaunay.from(c)
val v = d.voronoi(Rectangle(0.0, 0.0, 400.0, 400.0)) val v = d.voronoi(Rectangle(0.0, 0.0, 400.0, 400.0))
for (j in c.indices) { for (j in c.indices) {

2
orx-triangulation/src/commonTest/kotlin/TestVoronoiDiagram.kt
View File

@@ -10,7 +10,7 @@ import kotlin.test.assertTrue
class TestVoronoiDiagram { class TestVoronoiDiagram {
@Test @Test
fun testNeighbors() { fun testNeighbors() {
val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20).take(20) val c = Circle(200.0, 200.0, 150.0).contour.equidistantPositions(20)
val d = Delaunay.from(c) val d = Delaunay.from(c)
val v = d.voronoi(Rectangle(0.0, 0.0, 400.0, 400.0)) val v = d.voronoi(Rectangle(0.0, 0.0, 400.0, 400.0))
for (j in c.indices) { for (j in c.indices) {

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

@@ -23,7 +23,7 @@ fun main() {
drawer.clear(ColorRGBa.BLACK) drawer.clear(ColorRGBa.BLACK)
for ((i, triangle) in triangles.withIndex()) { for ((i, triangle) in triangles.withIndex()) {
drawer.fill = ColorRGBa.PINK.shade(1.0 - i / (triangles.size * 1.2)) drawer.fill = ColorRGBa.PINK.shade(1.0 - i / (triangles.size * 1.2))
drawer.stroke = ColorRGBa.PINK.shade( i / (triangles.size * 1.0) + 0.1) drawer.stroke = ColorRGBa.PINK.shade(i / (triangles.size * 1.0) + 0.1)
drawer.contour(triangle) drawer.contour(triangle)
} }
} }

1
orx-triangulation/src/jvmDemo/kotlin/DemoDelaunay02.kt
View File

@@ -1,6 +1,5 @@
import org.openrndr.application import org.openrndr.application
import org.openrndr.color.ColorRGBa import org.openrndr.color.ColorRGBa
import org.openrndr.extra.noise.poissonDiskSampling
import org.openrndr.extra.noise.scatter import org.openrndr.extra.noise.scatter
import org.openrndr.extra.triangulation.delaunayTriangulation import org.openrndr.extra.triangulation.delaunayTriangulation
import org.openrndr.math.Vector2 import org.openrndr.math.Vector2

2
orx-triangulation/src/jvmDemo/kotlin/DemoVoronoi03.kt
View File

@@ -23,7 +23,7 @@ fun main() {
rotate(Vector3.UNIT_Z, 0.0) rotate(Vector3.UNIT_Z, 0.0)
} }
) } ) }
val points = circles.flatMap { it.contour.equidistantPositions(16).take(16) } val points = circles.flatMap { it.contour.equidistantPositions(16) }
drawer.circles(points, 5.0) drawer.circles(points, 5.0)
val d = points.delaunayTriangulation() val d = points.delaunayTriangulation()
drawer.stroke = ColorRGBa.PINK drawer.stroke = ColorRGBa.PINK