1 / 23

Adaptive Quad Patches: Adaptive Structure for Web Distribution of 3D Models

This paper presents an adaptive quad patch approach for efficient storage, distribution, and rendering of 3D models on the web. The approach utilizes compact multiresolution representations and GPU-accelerated adaptive tessellation algorithm.

edmundj
Download Presentation

Adaptive Quad Patches: Adaptive Structure for Web Distribution of 3D Models

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Adaptive Quad Patches: an Adaptive Regular Structure for Web Distribution and Adaptive Rendering of 3D Models Enrico Gobbetti1, Fabio Marton1, Marcos Balsa Rodríguez1, Fabio Ganovelli2 and Marco Di Benedetto2 1 CRS4 Visual Computing Group, Sardinia Italy 2 ISTI-CNR Visual Computing Laboratory, Pisa Italy Web3D 2012 - Los Angeles, August 2012

  2. Context • 3D scanning systems has become commodity hardware • Easy to use • Fast • Portable • Increasing virtual world creation • Museums • Virtual shops and galleries • Games • WebGL • Mobile devices • Web integration • Internet • More users

  3. Motivation • 3D models • Heavy • Non-trivial to render • Non-linear inspection • Constrained environments • Lightweight • Interpreted • Scripted Javascript Reuse components already optimized!

  4. Pipeline overview • Unattended software pipeline • Compact multiresolution representation

  5. Adaptive Quad Patches – Approach • Remote rendering • Compact multiresolution representations • Storage • Distribution • Real-time rendering • Mesh reparametrization • Point cloud -> quad mesh • Multiresolution • Tightly packed texture atlas • Low CPU overhead • GPU accelerated adaptive tessellation algorithm • WebGL based • Portable platforms

  6. Related work • General solutions available for Desktop environments [Yoon et al. 2008] • Mesh compression – MPEG-4 [Jovanova et al. 2008] • View dependent LOD and progressive streaming [Hoppe 1997] • Compute view dependent triangulation each frame -> CPU bound • Surface patches [Cignoni et al. 2004] • Effective in terms of speed -> require non-trivial data structures and techniques for decompression • Geometry images [Gu et al. 2002] • Exploit current GPU capabilities / optimized libraries for compression and streaming of images

  7. Related work • Quad remeshing • Single-disk parametrization [Floater and Hormann 2005] • Simplest -> only genus-0 almost zero Gaussian curvature • Base mesh to parametrize the model [Petroni et al. 2010] • Quad-based domain -> tight packing and simpler handling of chart boundaries • Detail rendering • GPU raycasting [Oliveira et al. 2000] • Displacement mapping in GPU [Shiue et al. 2005] • Semi-uniform adaptive patch tessellation [Dyken et al. 2009]

  8. Pipeline overview • Unattended software pipeline • Compact multiresolution representation

  9. Pre-processing (Reparameterization) • Generate clean manifold triangle mesh • Poisson reconstruction [Kazhdan et al. 2006] • Remove topological noise • Discard connected components with too few triangles • Parameterize the mesh on a quad-based domain • Isometric triangle mesh parameterization • Abstract domains [Pietroni et al. 2010] • Remap into a collection of 2D square regions • Resample each quad from original geometry • Associates to each quad a regular grid of samples (position, color and normal)

  10. Pre-processing (geometry representation) • Coarse geometry • Quads (4 corners) • Detailed geometry • Displacement Texture • With respect to corner interpolation at (u,v) coordinates

  11. Pre-processing (Multiresolution) • Collection of variable resolution quad patches • Coarse representation of the original model • Multiresolution pyramids • Detail geometry • Color • Normals • Shared border information • Ensure connectivity

  12. Pre-processing (Multiresolution - filtering) • Ensure continuity (detail geometry, color, normals) • Special filtering maintains shared information on borders • Per patch quantization (quad ranges) • Max/min at patch corners -> Avoid discontinuities • PNG or S3TC compression • Geometry -> lossless PNG • Color and normals could be lossy • Tiled storage • N pyramids • Separated mipmap levels (per pyramid) • Mipmap levels splitted into tiles (e.g. 512x512)

  13. Adaptive rendering (Quad geometry information) • 4 3D corners with 16 bit / component • 4 Corners quantization ranges • Bilinear interpolation of quantization ranges ensure continuity among quads. • Patches of quantized 3D displacements • With respect to base quad

  14. Adaptive rendering (LOD selection) For each quad For each edge Evaluate edge LOD Quad LOD = max edge LOD (available) Edge LOD = Min(edge LOD, neighbor patches available LOD) If LOD not available Post request Use finest available LOD Priority = Required LOD - Available LOD

  15. Adaptive rendering (GPU Storage) 1 VBO per resolution level reused 1 stream of (u,v,e) information per vertex (e) determines the vertex (0,1,2,3, or 4 for inner vertices) K preallocated incomplete (filled on demand) texture mipmaps of Displacements Normals Colors Texture with quad ranges (dequantization) Texture with edge LODs

  16. Adaptive rendering (Pyramid Rendering) Bind pyramid textures For each quad Draw VBO with proper level triangulation Shaders Vertex: Dequantize using (u,v) coordinates Snap edge vertices (u,v,e) Displacement mapping Fragment Color Normal Shading.

  17. Adaptive rendering (Shader Geometry Dequantization) Base offset = quad corners Interpolation Interpolate dequantization ranges Dequantize displacement Sum displacement to base offset

  18. Rendering example Patches Levels Shading

  19. Adaptive streaming • Server • Tile repositories • No processing • Berkeley DB + Apache2 • Client (WebGL) • Priority = desired LOD – available LOD • Separate thread for receiving data • PNG decompression • Insertion into pyramid when ready

  20. Results (preprocessing) • Adaptive rendering • 1 pixel accuracy – 37 fps (min 13 fps) • Network streaming • Required 312Kbps (max 2.8Mbps) for no delay • ADSL 8Mbps – 2 s fully refined model from scratch

  21. Results • Tests configuration • 1.6Ghz laptop • 4GB RAM • Nvidia Geforce GTX 260M with 1GB VM • Linux Gentoo 2.6.39 • Chromium browser 19.0.1084.24b • ADSL 8MBps

  22. Conclusions • Effective creation and distribution system • Fully automatic • Compact, streamable and renderable 3D model representations • Low CPU overhead • WebGL • Desktop • Mobile • Limitations and future work • Closed objects with large components • Visual approximation (lossy) • Explore more aggressive compression techniques • Occlussion culling • More sophisticated shading/shadowing techniques

  23. Questions and contacts • CRS4 - Visual Computing Group http://vic.crs4.it • ISTI-CNR - Visual Computing Lab http://vcg.isti.cnr.it • Speaker: Marcos Balsa mbalsa@crs4.it • The DIVA project http://diva-itn.ifi.uzh.ch/ This research is partially supported by the EU FP7 Program under the DIVA project (290277).

More Related