Questions about your paper about cvpr2020-sdfdiff

[YueJiang-nj]

I think it is the same as what I did.
We are also using:
while not converged:
p += SDF(p) * v

[YueJiang-nj]

1. Is a simple approximation of an intersection point like p=s+SDF(s)v problematic?

SDF(s) is the closest distance to the object. But for intersection, we want to find the intersection point on the ray.
For example, if your current position has distance 1 cm to the surface, but you are parallel to the closest surface which is not along the ray. Then SDF(s) = 1 cm, but moving 1 cm along the ray will not let you reach the surface.

2. Why did you use the eight local samples some of which are not on the ray?

That's because we are using voxel-based SDF grid. So only the grid point values are known. For each point in the grid but is not exactly the grid point, the value can only be known by being trilinear interpolated from the surrounded grid point values. i.e., the 8 grid points around it on the little cube the point is in.

[skmhrk1209]

1. I mean,

# --- ray marching ---

# maybe the same as "renderer_kernel.cu"
with torch.no_grad():
    while not converged:
        p += SDF(p) * v

# make only the last step differentiable
with torch.enable_grad():
    p += SDF(p) * v

But I think this is impossible when using voxel-based SDF.

2. I had forgotten your network output is discrete SDF voxel. I got it now.

Thank you.

[lishixuan001]

Hi Yue,

Can the result be directly loaded into Autodesk 3D to reduce the work of 3D modeling? Or at least is it possible (in a validated way) for any other related works?