Angle-Analyzer: A Triangle-Quad Mesh Codec Haeyoung Lee USC Mathieu Desbrun USC Pierre Alliez INRIA.

Slides:



Advertisements
Similar presentations
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Advertisements

Geometry Compression Michael Deering, Sun Microsystems SIGGRAPH (1995) Presented by: Michael Chung.
Convex Hull obstacle start end Convex Hull Convex Hull
5/17/2015 1:32 AMConvex Hull1 obstacle start end.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Progressive Encoding of Complex Isosurfaces Haeyoung Lee Mathieu Desbrun Peter Schröder USC USC Caltech.
March 2, D Mesh Coding and Transmission Lihang Ying Department of Computing Science University of Alberta.

Compression opportunities using progressive meshes Hugues Hoppe Microsoft Research SIGGRAPH 98 course: “3D Geometry compression”
1 Spanning Trees Lecture 20 CS2110 – Spring
1 Displaced Subdivision Surfaces Aaron Lee Princeton University Henry Moreton Nvidia Hugues Hoppe Microsoft Research.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Compressing Texture Coordinates Martin IsenburgJack Snoeyink University of North Carolina at Chapel Hill with h Selective Linear Predictions.
Max-Plank Institut für Informatik systematic error parallelogram rule polygonal rules exact prediction Geometry Prediction for High Degree Polygons Martin.
Compressing Hexahedral Volume Meshes Martin Isenburg UNC Chapel Hill Pierre Alliez INRIA Sophia-Antipolis.
Martin Isenburg Jack Snoeyink University of North Carolina Chapel Hill Mesh Collapse Compression.
Martin Isenburg University of North Carolina at Chapel Hill Triangle Fixer: Edge-based Connectivity Compression.
Face Fixer Compressing Polygon Meshes with Properties Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.
Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill Reverse Decoding of the Edgebreaker Encoding S PIRALE R EVERSI.
Spatial and Temporal Data Mining
Polygonal Mesh – Data Structure and Smoothing
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
Lossless Compression of Floating-Point Geometry Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Jack Snoeyink UNC Chapel Hill.
With Parallelogram Prediction Compressing Polygon Mesh Geometry Martin Isenburg UNC Chapel Hill Pierre Alliez INRIA Sophia-Antipolis.
Compressing the Property Mapping of Polygon Meshes Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Compressing Polygon Mesh Connectivity
Kumar, Roger Sepiashvili, David Xie, Dan Professor Chen April 19, 1999 Progressive 3D Mesh Coding.
Space Efficient Point Location forTriangulations.
Streaming Compression of Triangle Meshes Martin Isenburg University of California at Berkeley Jack Snoeyink University of North Carolina at Chapel Hill.
Frederic Payan, Marc Antonini
Martin Isenburg UC Berkeley Jack Snoeyink UNC Chapel Hill Early Split Coding of Triangle Mesh Connectivity.
Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.
Progressive Encoding of Complex Iso-Surfaces Peter Schröder Caltech ASCI Alliance Center for Simulation of Dynamic Response of Materials Joint work with:
University of British Columbia Compressing Connectivity.
Coding with ASCII: compact, yet text-based 3D content Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill and INRIA Sophia-Antipolis.
An Introduction to 3D Geometry Compression and Surface Simplification Connie Phong CSC/Math April 2007.
Topological Surgery Progressive Forest Split Papers by Gabriel Taubin et al Presented by João Comba.
Out-of-Core Compression for Gigantic Polygon Meshes Martin IsenburgStefan Gumhold University of North CarolinaWSI/GRIS at Chapel Hill Universität Tübingen.
1 MESHCOMPRESSIONMESHCOMPRESSION EG99 Tutorial Mesh Compression.
Modeling and representation 2 – the economics of polygon meshes 3.1 Compressing polygonal models 3.2 Compressing the geometry (information per vertex)
Compressing Multiresolution Triangle Meshes Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo Department of Computer and Information Sciences.
Estimation-Quantization Geometry Coding using Normal Meshes
Viewpoint Entropy-driven Simplification Pascual Castelló 1, Mateu Sbert 2, Miguel Chover 1 and Miquel Feixas 2 1 Universitat Jaume I de Castelló, Spain.
Mesh Data Structure. Meshes Boundary edge: adjacent to 1 face Regular edge: adjacent to 2 faces Singular edge: adjacent to >2 faces Mesh: straight-line.
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies Tae-Joon Kim Bochang Moon Duksu Kim Sung-Eui Yoon KAIST (Korea Advanced Institute of.
3D Geometry Coding using Mixture Models and the Estimation Quantization Algorithm Sridhar Lavu Masters Defense Electrical & Computer Engineering DSP GroupRice.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Random-Accessible Compressed Triangle Meshes Sung-eui Yoon Korea Advanced Institute of Sci. and Tech. (KAIST) Peter Lindstrom Lawrence Livermore National.
Progressive Simplicial Complexes Jovan Popovic Carnegie Mellon University Jovan Popovic Carnegie Mellon University Hugues Hoppe Microsoft Research Hugues.
1 Compressing Triangle Meshes Leila De Floriani, Paola Magillo University of Genova Genova (Italy) Enrico Puppo National Research Council Genova (Italy)
Huffman Code and Data Decomposition Pranav Shah CS157B.
Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.
Agenda Review: –Planar Graphs Lecture Content:  Concepts of Trees  Spanning Trees  Binary Trees Exercise.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
04 MPEG-4, 1 Jarek Rossignac, CoC & GVU Center, Georgia Tech SM, June D Compression Jarek Rossignac GVU Center and College of Computing Georgia Tech,
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)
Streaming Compressed 3D Data on the Web using JavaScript and WebGL Université de Lyon, INSA-Lyon LIRIS UMR CNRS 5205 Guillaume Lavoué Florent Dupont Velvet.
Rossignac, Szymczak, King, Safonova
Greedy Technique.
A Brief History of 3D MESH COMPRESSION ORAL, M. ELMAS, A.A.
Convex Hull obstacle start end 11/21/2018 4:05 AM Convex Hull
Efficient Edgebreaker for surfaces of arbitrary topology
Wavelet-based Compression of 3D Mesh Sequences
Chap 10. Geometric Level of Detail
Convex Hull obstacle start end 4/30/2019 5:21 PM Convex Hull
Subdivision Surfaces 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Presentation transcript:

Angle-Analyzer: A Triangle-Quad Mesh Codec Haeyoung Lee USC Mathieu Desbrun USC Pierre Alliez INRIA

2 Introduction: 3D Compression

3 FocusFocus A Single-rate, Lossy Compression  Single-rate vs progressive compression  Lossy vs. lossless compression Contribution: Better Bitrates  40 % better in connectivity, 20 % better in geometry  Improves transmission time, storage space, …

4 Previous Work: Connectivity 3 main approaches, based on: » Triangle strips » Edge/gate traversal » Valence

5 Edge/Gate Traversal I [Rossignac 99] & follow-ups: EdgeBreaker  5 symbols (+2 for arbitrary genus)  Spiraling depth-first spanning tree traversal  Connectivity: ~4 b/v

6 Edge/Gate Traversal II [Gumhold 00] : CutBorder Machine  6 Symbols  Breadth-first traversal  Connectivity: ~3.55 b/v [Isenburg & Snoeyink 00]  Polygon meshes Overall, 2V symbols

7 Valence-based Approaches I [Touma & Gotsman 98] Deterministic traversal by pivoting around vertices [Isenburg & Snoeyink 99]  Edge collapses  One valence symbol per removed vertex

8 Valence-based Approaches II [Alliez & Desbrun 01] Improvements upon [TG98]:  Adaptive traversal  Worst case: 3.24b/v [Li & Kuo 98] & [Khodakovsky, Alliez, Desbrun, Schröder 02] Polygon meshes using duality Overall, only V symbols

9 Previous Work: Geometry Delta Encoding [Deering 95] Predictions [Taubin & Rossignac 98] Global Quantization [Touma & Gotsman 98] Vector Quantization [Lee & Ko 00] Occurrence [Devillers & Gandoin 00, 02] Wavelet-based compression [KWS 00]

10 Our Algorithm: Angle-Analyzer Our Goal: Triangle, Quad, and Hybrid Meshes (most common!) + Easiness of implementation Mix edge/gate traversal & valence approach! Our Contribution: 20% better than [TG98] 40% better in connectivity 19% better in geometry

11 Our Algorithm: Angle-Analyzer Our Connectivity Encoder:  Small number of fixed symbols, easy to code  Adaptive traversal & low-entropy sequence Our Geometry Encoder:  Local coordinate system  Intrinsic & extrinsic angles  Entropy-driven quantization

12 Angle-Analyzer: Definitions  Gate  Front Vertices  Back Face  Front Face  Active Gate List  Gate Lists in a Stack V0 V1 front face back face front vertex gate left frontright front gate V0 V1 V0 V1 front face back face front vertex gate left frontright front gate V0 V1 Blue: visited Grey: to be visited

13 Triangle Mesh Connectivity Only 5 symbols: C, CW, CCW, S, J C (Create) CW (Mesh Clockwise) CCW (Mesh Counterclockwise) S (Skip) J (Join) V0 V1 V0 V1 V0 V1 V0 V1 V0 V1

14 Quad Mesh Connectivity 8 symbols: C2, CR, CL, Mesh, DCCW, DCW, S, JQ C2(Create 2) CR (Create Right Front) CL (Create Left Front) JQ (Join for Quad) Mesh (just mesh) DCW (Double -Clockwise) DCCW (Double - Counterclockwise) Red: new, Grey: old Yellow: possibly new

15 Hybrid Mesh Connectivity 12 symbols, depending on the front face: C, CW, CCW, S, J, C2, CR, CL, Mesh, DCCW, DCW, JQ V0 V1 front face front vertex left frontright front V0 V1 back face

16 Adaptive Traversal - Heuristic Minimize #J(JQ) by choosing best gate:  min angle between two successive gates Geometry-driven adaptive traversal J CW with [AD01]: with new heuristic:

17 Geometry-Driven Traversal Model #V#J based on deterministic traversal #J based on [AD01] #J based on minimum angle Feline Maxplanck Horse Egea_tf Dinosaur Nefertiti_u Foot Venus Egea_u Body Nefertiti Improvements due to new heuristic:

18 Connectivity for Triangle Meshes 40% better on average model#VTG98LAD02 Feline Maxplanck Horse Egea_tf Dinosaur Nefertiti_u Foot Venus Egea_u Body Bit rates in b/v

19 Connectivity for Quad Meshes Model#VLAD02 Feline.quad Head.quad Rockerarm.quad Venus.quad David.quad Genus3.quad Body.quad Uglybox.quad Tiger.quad Nefertiti.quad

20 Angle-Analyzer: Geometry (1) Local Coordinate Based Geometry 2-pass algorithm:  Range search  Transform global to Local Coordinate system then Quantize (x,y,z) Front vertex V0 V1 X-axis Z-axis Y-axis Front face

21 Angle-Analyzer: Geometry (2) Angle-based Geometry Single-pass algorithm: Just quantize angles! Predefined ranges for angles: (0,  ) for  (-  ) for      Front vertex Front face V0 V1

22 Angle-Analyzer: Geometry(3) Entropy-Driven Geometry Encoding Choose one among 8 candidates on a cube with lowest local entropy  Easy to extend: pick whatever vertex is the cheapest for an equivalent geometric error… Front vertex V1 Front face V0

23 Discussion on Geometry Distortion computed with Metro Bit Rate

24 Discussion on Geometry Better visual results (i.e., distortion) for less bits! Original TG-9bit (7.32b/v) Angle–Analyzer (6.88b/v)

25 Discussion on Geometry Original TG-10bit (7.94b/v) Angle–Analyzer (6.58b/v) Better visual results (i.e., distortion) for less bits!

26 Result Overview modelOrig File(KB) Comp (KB) TG- 12bits(b/v) Angle (b/v) vs. TG- 12bits feline5, % maxplanck2, % Horse2, % Egea_tf21, % Nefertiti_u1, % Sphere1, % Egea_u % random % 20% better in overall ratios than TG98 with 12bit

27 Work Done A single-rate compression algorithm for 3D triangle-quad meshes Contribution to connectivity  Fixed number of Symbols (smaller than previous)  New geometry-driven adaptive traversal (40% better) Contribution to geometry  New intrinsic and extrinsic angle encoding  New local coordinate frame  New entropy-driven quantization (19% better) Competitive compression ratios (20%better)

28 Future Work Goal: Extending Angle-Analyzer to handle polygonal meshes and non-manifold meshes Reducing bit rate further on geometry Why: Many non-manifold meshes in practice Comparatively little work on non-manifold mesh compression (Devillers & Gandouin) Seems like geometry compression is not optimal…

29 AcknowledgementsAcknowledgements IMSC, NSF Yiying Tong Laehyun Kim Anna Kyrikou