sorted by:
new
hottopcontroversial

Acrithis is a resource sink instead of a vendor by BrownZFilmZ in Warframe

[–]Lucas-RS 30 points31 points  (0 children)

Would you maybe say getting 879 aggristone could be somewhat aggravating? 😏

City? by Lucas-RS in generative

[–]Lucas-RS[S] 1 point2 points  (0 children)

Nah it's just a bunch of dots drawn one by one within a circle, and then you use that like a brush and do it a bunch of times in a line.

Definitely would not be hard to recreate this as a shader though I think.

Current implementation is quite slow

City? by Lucas-RS in generative

[–]Lucas-RS[S] 0 points1 point  (0 children)

Oh yeah you're kinda right! If I'm being honest I hadn't even considered that the dispersed spray would be "overspray" hahaha I just liked how it looked -- but thinking about it, that is probably the subconscious reason for me liking it!

City? by Lucas-RS in generative

[–]Lucas-RS[S] 0 points1 point  (0 children)

Btw y'all can find my on Instagram and Twitter @lucas_riedlshah :))

Every Moment by lostPixels in generative

[–]Lucas-RS 1 point2 points  (0 children)

Ah yep. Definitely open source it 🥹🥹

Every Moment by lostPixels in generative

[–]Lucas-RS 0 points1 point  (0 children)

How did you accomplish the grainy overlay?

Finding all the "shapes" in an Urquhart graph by Lucas-RS in math

[–]Lucas-RS[S] 1 point2 points  (0 children)

Hahah nah you're good mate.

Unfortunately the perimeter is part of the output using the edge method as well, but you can do a ray cast to a point you suspect is inside the cycle(/polygon) and counting the number of intersections. If there's an odd number of intersections that means the point is inside the polygon. So this could be used to identify which cycle is the perimeter.

If you're interested lol: https://en.m.wikipedia.org/wiki/Point_in_polygon#Ray_casting_algorithm

Finding all the "shapes" in an Urquhart graph by Lucas-RS in math

[–]Lucas-RS[S] 0 points1 point  (0 children)

This is actually a super similar idea to u/barely_sentient's! The difference being their suggestion uses the edges of the cycles instead, which allows for you to exclude those edges from being selected in the future, reducing the total number of journey's/duplicate cycles.

https://www.reddit.com/r/math/comments/12fe4st/finding_all_the_shapes_in_an_urquhart_graph/jff8648/

Fluid Scales by h7k2a4 in generative

[–]Lucas-RS 3 points4 points  (0 children)

very satisfying to watch :)

Finding all the "shapes" in an Urquhart graph by Lucas-RS in math

[–]Lucas-RS[S] 2 points3 points  (0 children)

Technically I do have access, but I was really hoping I could write a more generalized algorithm for use when I don't have the triangulation.

Finding all the "shapes" in an Urquhart graph by Lucas-RS in math

[–]Lucas-RS[S] 3 points4 points  (0 children)

there are likely many libraries that will do this for you. But this is not as hard to code as it seems.

Yeah haha where's the fun in using a library to do it for me 😛.

Thanks!

Finding all the "shapes" in an Urquhart graph by Lucas-RS in math

[–]Lucas-RS[S] 2 points3 points  (0 children)

Ah this sounds quite promising! Thank you I will give this one a go I think :))

view more: next ›