eBits: Compact stream of mesh refinements for remote visualization

Abstract We focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M , but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh, pre-computed on the server via a series of simplification passes on M , one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes to the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag ​–the LoD at which it will be expanded if it lies in the RoI–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.

[1]  Seungyong Lee,et al.  Multiresolution Random Accessible Mesh Compression , 2006, Comput. Graph. Forum.

[2]  Peter Lindstrom,et al.  Random-Accessible Compressed Triangle Meshes , 2007, IEEE Transactions on Visualization and Computer Graphics.

[3]  Seungyong Lee,et al.  Truly Selective Refinement of Progressive Meshes , 2001, Graphics Interface.

[4]  Rémy Prost,et al.  Progressive Lossless Mesh Compression Via Incremental Parametric Refinement , 2009, Comput. Graph. Forum.

[5]  Céline Hudelot,et al.  POMAR: Compression of progressive oriented meshes accessible randomly , 2013, Comput. Graph..

[6]  Jarek Rossignac,et al.  Guaranteed 3.67v bit encoding of planar triangle graphs , 1999, CCCG.

[7]  Jihad El-Sana,et al.  Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

[8]  Pierre Alliez,et al.  Angle‐Analyzer: A Triangle‐Quad Mesh Codec , 2002, Comput. Graph. Forum.

[9]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[10]  Pierre Alliez,et al.  Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes , 2002, Graph. Model..

[11]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.

[12]  Leila De Floriani,et al.  Bisection-Based Triangulations of Nested Hypercubic Meshes , 2010, IMR.

[13]  Jarek Rossignac,et al.  LR: compact connectivity representation for triangle meshes , 2011, ACM Trans. Graph..

[14]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[15]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

[16]  Herbert Edelsbrunner,et al.  Topology preserving edge contraction , 1998 .

[17]  Jarek Rossignac,et al.  Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces , 2003 .

[18]  David J. Kriegman,et al.  Compressing large polygonal models , 2001, Proceedings Visualization, 2001. VIS '01..

[19]  Renato Pajarola,et al.  Compressed Progressive Meshes , 2000, IEEE Trans. Vis. Comput. Graph..

[20]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[21]  Yo-Sung Ho,et al.  Predictive compression of geometry, color and normal data of 3-D mesh models , 2006, IEEE Transactions on Circuits and Systems for Video Technology.

[22]  Gabriel Taubin,et al.  Progressive forest split compression , 1998, SIGGRAPH.

[23]  Meenakshisundaram Gopi,et al.  Hierarchyless Simplification, Stripification and Compression of Triangulated Two‐Manifolds , 2005, Comput. Graph. Forum.

[24]  Olivier Devillers,et al.  Progressive lossless compression of arbitrary simplicial complexes , 2002, SIGGRAPH.

[25]  Giovanni Motta,et al.  Handbook of Data Compression , 2009 .

[26]  Jarek Rossignac,et al.  Dynapack: space-time compression of the 3D animations of triangle meshes with fixed connectivity , 2003, SCA '03.

[27]  Seungyong Lee,et al.  Random Accessible Mesh Compression Using Mesh Chartification , 2009, IEEE Transactions on Visualization and Computer Graphics.

[28]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[29]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[30]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[31]  Renato Pajarola,et al.  SQUEEZE: fast and progressive decompression of triangle meshes , 2000, Proceedings Computer Graphics International 2000.