Skip to content

perf: faster decompression #60

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
william-silversmith merged 2 commits into from
May 2, 2026
Merged

perf: faster decompression #60

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ce64516
perf: PRED decision tree seems to have some benefit
william-silversmith May 2, 2026
c163d4c
perf: finding a real benefit now
william-silversmith May 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
59 changes: 53 additions & 6 deletions src/cc3d.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -161,6 +161,10 @@ OUT* color_connectivity_graph(
out_labels = new OUT[voxels]();
}

if (voxels == 0) {
return out_labels;
}

DisjointSet<OUT> equivalences(max_labels);

OUT new_label = 0;
Expand All @@ -180,24 +184,67 @@ OUT* color_connectivity_graph(
const int64_t C = -sx;

for (int64_t y = 1; y < sy; y++) {
for (int64_t x = 0; x < sx; x++) {
int64_t loc = x + sx * y + sxy * z;
int64_t loc = sx * y + sxy * z;
int64_t x = 0;

if (x > 0 && (vcg[loc] & 0b0010)) {
if (vcg[loc] & 0b1000) {
out_labels[loc] = out_labels[loc+C];
goto SIMPLE;
}
else {
new_label++;
out_labels[loc] = new_label;
equivalences.add(new_label);
goto COMPLEX;
}

COMPLEX:
x++;
loc++;
if (x >= sx) {
continue;
}

if (vcg[loc] & 0b0010) {
out_labels[loc] = out_labels[loc+B];
if (y > 0 && (vcg[loc + B] & 0b1000) == 0 && (vcg[loc] & 0b1000)) {
if ((vcg[loc + B] & 0b1000) == 0 && (vcg[loc] & 0b1000)) {
equivalences.unify(out_labels[loc], out_labels[loc+C]);
goto SIMPLE;
}
goto COMPLEX;
}
else if (y > 0 && vcg[loc] & 0b1000) {
else if (vcg[loc] & 0b1000) {
out_labels[loc] = out_labels[loc+C];
goto SIMPLE;
}
else {
new_label++;
out_labels[loc] = new_label;
equivalences.add(new_label);
goto COMPLEX;
}
}

SIMPLE:
x++;
loc++;
if (x >= sx) {
continue;
}

if (vcg[loc] & 0b0010) {
out_labels[loc] = out_labels[loc+B];
goto COMPLEX;
}
else if (vcg[loc] & 0b1000) {
out_labels[loc] = out_labels[loc+C];
goto SIMPLE;
}
else {
new_label++;
out_labels[loc] = new_label;
equivalences.add(new_label);
goto COMPLEX;
}
}
}

Expand Down
Loading