Given a 3D mesh, the quantized 3D vertices are first partitioned into an octree structure, which is then traversed from the root and gradually to the leaves.

Abstract—A progressive lossless 3D mesh encoder using the octree-based space partitioning of vertex data is proposed in this work. Given a 3D mesh, ...

Given a 3D mesh, the quantized 3D vertices are first partitioned into an octree structure, which is then traversed from the root and gradually to the leaves.

An octree(OT)-based progressive lossless 3D mesh encoder was proposed in this work to process 3D meshes of any topology. In- stead of encoding the vertex ...

A new progressive lossless 3D triangular mesh encoder is proposed in this work, which can encode any 3D triangular mesh with an arbitrary topological structure.

A progressive 3D geometry coding scheme using octree-based space partitioning is proposed in this work, which achieves better coding efficiency than the ...

Given a mesh, the quantized 3D vertices are first partitioned into an octree (OT) structure, which is then traversed from the root and gradually to the leaves.

... encoder can be potentially used for lossless geometry coding of 3D point clouds, given sufficient levels of octree expansion and normal space partitioning.

An octree-based geometry coder is proposed that demands a less amount of coding bits at high octree levels by applying selective cell subdivision at high ...

Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition. A new progressive lossless 3D triangular mesh encoder is proposed in this ...