Voxel Grouping Algorithm

[x86_architecture (Au198)]

Here are a couple of topics on the devforum that you should consider looking at:

Consume everything - how greedy meshing works

Hey! I initially made this as a response to a DM I got asking how my greedy mesher algorithm for Blox works. Greedy meshing is a really useful concept when working with voxels, especially in Roblox where large numbers of parts can cause a lot of lag. The idea is to combine adjacent blocks with each other, to reduce the part count while visually keeping everything the same. [image] In the above picture, the red scene has 15931 instances. The blue scene only has 508. Anyways, the following is…

How to make a Greedy Mesher

This post will show you how to make a 2D(easily extendable to 3D) greedy mesher for all your voxel optimization needs(i would not recommend visible faces only for this as it runs slower than all in my testing). So let’s start by making a heightmap. But inside of that we will also make a table of whether or not it has been visited before(you’ll see why later). Make the map Okay so let’s start by defining the tables. For your height map, you can use any function you want, if its math.noise or ju…