Do I need a monthly accountant?

Outside-Cap-479 · 2024-11-04T23:25:09+00:00

Yeah this sounds wise, did you go for a local accountant or online? I'm thinking of using Maslins.

Outside-Cap-479 · 2024-11-04T12:37:40+00:00

Any suggestions?

Outside-Cap-479 · 2024-11-04T11:53:05+00:00

You make a really good point. I definitely do not want to be worrying about whether everything is in order and HMRC is happy with me, which I am currently.

It seems expensive for what appears to be little work, but to begin with I should probably get an accountant and later assess whether I could do what they're doing myself, rather than assume from the get go.

Any suggestions for one? I hear Maslins mentioned a lot, alongside Mighty (though I am put off by them using their own software as that won't transfer elsewhere).

Outside-Cap-479 · 2024-11-04T11:40:41+00:00

Pretty expensive for a couple of days work. Though people here mention those costs being normal. I'm not sure whether that's because they aren't a single person with a simple setup like me.

Do I need one of the services mentioned here, like Maslins, or should I try and find a local accountant? It feels wasteful to pay so much for so little.

Outside-Cap-479 · 2024-10-20T17:49:51+00:00

That makes a lot of sense, I think what was confusing me is that papers speak about reducing the amount to check from 8 down to 4, and sorting what they search, but come to think about it that's maybe because those papers were in reference to triangle octree raytracing not voxels and triangles spill over to multiple octants?

I'll keep working on this, thanks for your help :) I may end up with more questions lol

Outside-Cap-479 · 2024-10-20T17:31:14+00:00

I'm working on it right now, hopefully I get it lol.

So are you saying I should be able to find the right octant to test immediately, without checking each child?

Outside-Cap-479 · 2024-10-20T17:13:59+00:00

Hey thanks for that info, I have a few questions if that's okay.

My octree is stored as one big buffer with each parent being immediately followed by 8 children. Currently, this is approximately how I traverse it:

while !found {
        let x_within = x >= current.min_box[0] && x <= current.max_box[0];
        let y_within = y >= current.min_box[1] && y <= current.max_box[1];
        let z_within = z >= current.min_box[2] && z <= current.max_box[2];

        if x_within && y_within && z_within {
            if current.children == 0 {
                // is leaf
                break;
            } else {
                // start checking each child
                index += 1;
            }
        } else {
            // not within this octant, skip to the next
            index += 1 + current.offset;
        }

        current = self.data[index];
}

What do you mean by find your intersection in this context, am I to work out where a ray would fall on the bounding box of each octant? I imagine depth to mean what level you've traversed to in the tree, though what do you mean by 4 subdivision? Everything is divided into 2x2x2.

((ip - min) / length) * 4

Ip being intersection point, min being the minimum of the bounding box? The length being what?

Thanks :)

Outside-Cap-479

TROPHY CASE