Search Menu
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information
Search Scholarly Publications

Title: eBits: Compact stream of mesh refinements for remote visualization

Abstract

Here, 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 themore » 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 Rol–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.« less

Authors:
ORCiD logo [1];  [2];  [1]
+ Show Author Affiliations
  1. Georgia Inst. of Technology, Atlanta, GA (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
Research Org.:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
OSTI Identifier:
1438722
Alternate Identifier(s):
OSTI ID: 1324015
Report Number(s):
LLNL-JRNL-692377
Journal ID: ISSN 0010-4485
Grant/Contract Number:  
AC52-07NA27344
Resource Type:
Accepted Manuscript
Journal Name:
Computer Aided Design
Additional Journal Information:
Journal Volume: 78; Journal Issue: C; Journal ID: ISSN 0010-4485
Publisher:
Elsevier
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; Triangle mesh compression; Remote visualization; Level of detail; Selective transmission; Local refinement; Triangle collapse

Citation Formats

Sati, Mukul, Lindstrom, Peter, and Rossignac, Jarek. eBits: Compact stream of mesh refinements for remote visualization. United States: N. p., 2016. Web. doi:10.1016/j.cad.2016.05.016.
Copy to clipboard
Sati, Mukul, Lindstrom, Peter, & Rossignac, Jarek. eBits: Compact stream of mesh refinements for remote visualization. United States. https://doi.org/10.1016/j.cad.2016.05.016
Copy to clipboard
Sati, Mukul, Lindstrom, Peter, and Rossignac, Jarek. Thu . "eBits: Compact stream of mesh refinements for remote visualization". United States. https://doi.org/10.1016/j.cad.2016.05.016. https://www.osti.gov/servlets/purl/1438722.
Copy to clipboard
@article{osti_1438722,
title = {eBits: Compact stream of mesh refinements for remote visualization},
author = {Sati, Mukul and Lindstrom, Peter and Rossignac, Jarek},
abstractNote = {Here, 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 Rol–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.},
doi = {10.1016/j.cad.2016.05.016},
journal = {Computer Aided Design},
number = C,
volume = 78,
place = {United States},
year = {Thu May 12 00:00:00 EDT 2016},
month = {Thu May 12 00:00:00 EDT 2016}
}
Copy to clipboard
Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1016/j.cad.2016.05.016
Copyright Statement
Other availability
Search WorldCat Search WorldCat to find libraries that may hold this journal
Citation Metrics:
Cited by: 1 work
Citation information provided by
Web of Science
Save / Share:
Export Metadata
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

Works referenced in this record:

Edgebreaker: connectivity compression for triangle meshes
journal, January 1999

  • Rossignac, J.
  • IEEE Transactions on Visualization and Computer Graphics, Vol. 5, Issue 1
  • DOI: 10.1109/2945.764870

Progressive forest split compression
conference, January 1998

  • Taubin, Gabriel; Guéziec, André; Horn, William
  • Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98
  • DOI: 10.1145/280814.280834

Geometric compression through topological surgery
journal, April 1998

  • Taubin, Gabriel; Rossignac, Jarek
  • ACM Transactions on Graphics, Vol. 17, Issue 2
  • DOI: 10.1145/274363.274365

Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
journal, May 2002

  • Khodakovsky, Andrei; Alliez, Pierre; Desbrun, Mathieu
  • Graphical Models, Vol. 64, Issue 3-4
  • DOI: 10.1006/gmod.2002.0575

Angle-Analyzer: A Triangle-Quad Mesh Codec
journal, September 2002

Random-Accessible Compressed Triangle Meshes
journal, November 2007

  • Yoon, Sung-eui; Lindstrom, Peter
  • IEEE Transactions on Visualization and Computer Graphics, Vol. 13, Issue 6
  • DOI: 10.1109/TVCG.2007.70585

Progressive meshes
conference, January 1996

  • Hoppe, Hugues
  • Proceedings of the 23rd annual conference on Computer graphics and interactive techniques - SIGGRAPH '96
  • DOI: 10.1145/237170.237216

Adaptive real-time level-of-detail based rendering for polygonal models
journal, January 1997

  • Xia, J. C.; El-Sana, J.; Varshney, A.
  • IEEE Transactions on Visualization and Computer Graphics, Vol. 3, Issue 2
  • DOI: 10.1109/2945.597799

View-dependent refinement of progressive meshes
conference, January 1997

  • Hoppe, Hugues
  • Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
  • DOI: 10.1145/258734.258843

Compressed progressive meshes
journal, January 2000

  • Pajarola, R.; Rossignac, J.
  • IEEE Transactions on Visualization and Computer Graphics, Vol. 6, Issue 1
  • DOI: 10.1109/2945.841122

Progressive compression for lossless transmission of triangle meshes
conference, January 2001

  • Alliez, Pierre; Desbrun, Mathieu
  • Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01
  • DOI: 10.1145/383259.383281

Progressive lossless compression of arbitrary simplicial complexes
journal, July 2002

  • Gandoin, Pierre-Marie; Devillers, Olivier
  • ACM Transactions on Graphics, Vol. 21, Issue 3
  • DOI: 10.1145/566654.566591

Progressive Lossless Mesh Compression Via Incremental Parametric Refinement
journal, July 2009

Multiresolution Random Accessible Mesh Compression
journal, September 2006

POMAR: Compression of progressive oriented meshes accessible randomly
journal, October 2013

Predictive compression of geometry, color and normal data of 3-D mesh models
journal, February 2006

  • Ahn, Jeong-Hwan; Kim, Chang-Su; Ho, Yo-Sung
  • IEEE Transactions on Circuits and Systems for Video Technology, Vol. 16, Issue 2, p. 291-299
  • DOI: 10.1109/TCSVT.2005.861945

Mesh optimization
conference, January 1993

  • Hoppe, Hugues; DeRose, Tony; Duchamp, Tom
  • Proceedings of the 20th annual conference on Computer graphics and interactive techniques - SIGGRAPH '93
  • DOI: 10.1145/166117.166119

Hierarchyless Simplification, Stripification and Compression of Triangulated Two-Manifolds: Simplification, Stripification and Compression
journal, September 2005

LR: compact connectivity representation for triangle meshes
journal, July 2011

  • Gurung, Topraj; Luffel, Mark; Lindstrom, Peter
  • ACM Transactions on Graphics, Vol. 30, Issue 4
  • DOI: 10.1145/2010324.1964962
    Sort by:
    [ × clear filter / sort ]

    Similar Records in DOE PAGES and OSTI.GOV collections: