Create accountLogin

Recent searches

No recent searches

Search options

Only available when logged in.
shakedown.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A community for live music fans with roots in the jam scene. Shakedown Social is run by a team of volunteers (led by @clifff and @sethadam1) and funded by donations.

Administered by:

Server stats:

297
active users

shakedown.social: AboutStatusProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.4

#computergraphics

1 post1 participant0 posts today
Public
Ian Badcoe

#GameDev #ComputerGraphics #Normals #Meshes I am already well familiar with the concepts of vertex and face normals, and I know ways to calculate them for simple, or even quite complex cases. Simple being all smooth, or all facetted. Moderately complex being where we have some sharp and some smooth edges, maybe based on an angular threshold, and can share or split verts/normals accordingly.

But... but... what do we do when the mix of sharp and smooth edges is ambiguous, like in the picture. The red edge is sharp and the three blue ones are smooth, so how do we treat the 4 polygons where they meet at the vertex? There is no clean division between polys which connect smoothly and ones which should be separate rotating anticlockwise from A to D, all the edges should be smooth, so A should share a normal with B, and thus with C and eventually D, but going the other way, from A straight to D, we'd like the line to be sharp and we'd like them not to share. Obviously we can't have both. It's a puzzler...

A diagram showing a corner where four squares meet, the squares are labelled A, B, C and D. All squares are separated by blue lines, except A and D which are separated by a red line...
Public *
grz0zrg

A very simple way to draw HAKMEM 149 based structures by using whole 32 bits range with upper bits as coordinates using unsigned shifts.

This also works with a lower range but it loses precision.

The oblique version is even simpler by removing the last two operations.

The structure looks like Apollonian net or Hopalong attractors.

This drawing method also works with other attractors or Gingerbread man map etc.

HAKMEM 149 based structure produced by the attached code
HAKMEM 149 based structure produced by the shown code with : x -= 1 << 30
simplified p5js code of the HAKMEM 149 structure using 32 bits range with upper bits taken as coordinates, coordinates shifts are adapted to a 512x512 framebuffer. The X and Y offsets can be modified to show different structures, this can also be simplified by removing the offsets code and initializing X and Y with large values. For this particular case "y += 1 << 31" is unneeded (produce the same result)
#sizecoding#codegolfing#algorithm
Public
Uli Kusterer (Not a kitteh)

Does Wikipedia really have no article on loading tunnels in computer games?

You know, those spots where you squeeze through a crack in a wall, walks through a corridor with a wall in the middle where the path splits and goes around it, or takes an elevator, which allows the game to unload most of the previous level (which you can’t see anymore now) and start loading the next level, instead of interrupting the game with a loading screen?

Is there a more generic term for that?

#computerGraphics
ExploreLive feeds
About