This paper is similar to the implicit network paper, but the only difference is that instead of sequencially passing the coordinates, they parallelly pass all the coordinates together to make the best use of GPU
We first mark all points at a given resolution that have already been evaluated as either occupied (red circles) or unoccupied (cyan diamonds). We mark all grid points p as occupied for which fθ(p,x) is bigger or equal to some threshold τ. We then determine all voxels that have both occupied and unoccupied corners and mark them as active (light red) and subdivide them into 8 subvoxels each. Next, we evaluate all new grid points (empty circles) that have been introduced by the subdivision. The previous two steps are repeated until the desired output resolution is reached. Finally, we extract the mesh using the marching cubes algorithm, simplify and refine the output mesh using first and second-order gradient information.
- IoU
- Chamfer - L1
- Normal Consistency Score
- ShapeNet
- KITTI
- Online Products dataset
Pytorch Code : Code
Paper : Paper