Face Fixer Compressing Polygon Meshes with Properties Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.

Slides:

Advertisements

Similar presentations

Geometry Compression Michael Deering, Sun Microsystems SIGGRAPH (1995) Presented by: Michael Chung.

Advertisements

Geometry Image Xianfeng Gu, Steven Gortler, Hugues Hoppe SIGGRAPH 2002 Present by Pin Ren Feb 13, 2003.

Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.

3D Surface Parameterization Olga Sorkine, May 2005.

MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.

Geometry Images Steven Gortler Harvard University Steven Gortler Harvard University Xianfeng Gu Harvard University Xianfeng Gu Harvard University Hugues.

Subdivision Curves & Surfaces and Fractal Mountains. CS184 – Spring 2011.

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

Martin Isenburg University of North Carolina at Chapel Hill Craig Gotsman Technion - Israel Institute of Technology Stefan Gumhold University of Tübingen.

CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.

Spherical Parameterization and Remeshing Emil Praun, University of Utah Hugues Hoppe, Microsoft Research.

Compression opportunities using progressive meshes Hugues Hoppe Microsoft Research SIGGRAPH 98 course: “3D Geometry compression”

Compressing Texture Coordinates Martin IsenburgJack Snoeyink University of North Carolina at Chapel Hill with h Selective Linear Predictions.

Fractal Mountains, Splines, and Subdivision Surfaces Jordan Smith UC Berkeley CS184.

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.

Large Mesh Simplification using Processing Sequences Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Stefan Gumhold GRIS Tubingen Jack Snoeyink.

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.

Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill Reverse Decoding of the Edgebreaker Encoding S PIRALE R EVERSI.

Simplification of Arbitrary Polyhedral Meshes Shaun D. Ramsey* Martin Bertram Charles Hansen University of Utah University of Kaiserslautern University.

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.

Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.

Compressing the Property Mapping of Polygon Meshes Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.

Content Subdivision First some basics (control point polygon, mesh)

Compressing Polygon Mesh Connectivity

Streaming Compression of Triangle Meshes Martin Isenburg University of California at Berkeley Jack Snoeyink University of North Carolina at Chapel Hill.

Irregular to Completely Regular Meshing in Computer Graphics Hugues Hoppe Microsoft Research International Meshing Roundtable 2002/09/17 Hugues Hoppe Microsoft.

Martin Isenburg UC Berkeley Jack Snoeyink UNC Chapel Hill Early Split Coding of Triangle Mesh 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.

Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.

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.

Geometry Videos Symposium on Computer Animation 2003 Hector M. Briceño Collaborators: Pedro V. Sander, Leonard McMillan, Steven Gortler, and Hugues Hoppe.

Compression of Large Engineering 3D Models using Automatic Discovery of Repeating Geometric Features. Compression of Large Engineering 3D Models using.

1 MESHCOMPRESSIONMESHCOMPRESSION EG99 Tutorial Mesh Compression.

Classifying Polygons.

Lesson (1-6): Polygons_ p: 45 A polygon is a closed figure whose sides are all segments that intersect only at their endpoints examples polygonnot a polygon:

Geometry Images Xiang Gu Harvard University Steven J. Gortler Harvard university Hugues Hoppe Microsoft Research Some slides taken from Hugues Hoppe.

Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.

8.2 Angles in Polygons Polygon Number of sides Number of triangles Sum of measures of interior angles Triangle Quadrilateral Pentagon Hexagon Heptagon.

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.

1 Compressing Triangle Meshes Leila De Floriani, Paola Magillo University of Genova Genova (Italy) Enrico Puppo National Research Council Genova (Italy)

Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.

Warm-Up Draw an example of a(n)…

Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.

Geometric Modeling How to design a graphical model? How to create a digital description of a real-world object? Design Digitize.

POLYGONS A polygon is a closed plane figure that has 3 or more sides.

1 Compressing TINs Leila De Floriani, Paola Magillo University of Genova Genova (Italy) Enrico Puppo National Research Council Genova (Italy)

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,

Polygons Advanced Geometry Polygons Lesson 1. Polygon a closed figure Examples NO HOLES NO CURVES SIDES CANNOT OVERLAP all sides are segments.

Geometry Name: __________________________ Unit 4 WS 2Date: __________________________ Identify the polygon by name, whether it is convex or non convex,

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

A Brief History of 3D MESH COMPRESSION ORAL, M. ELMAS, A.A.

How many diagonals in a… 1. Triangle _______ 2. Heptagon _______

Extensions to Edgebreaker

Efficient Edgebreaker for surfaces of arbitrary topology

Mesh Parameterization: Theory and Practice

Math Humor Q: What type of figure is like a lost parrot?

Progressive coding Motivation and goodness measures

Wavelet-based Compression of 3D Mesh Sequences

a closed figure whose sides are straight line segments.

Presentation transcript:

Face Fixer Compressing Polygon Meshes with Properties Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill

Polygon Models: Triceratops 356triangles 2266quadrangles 140pentagons 63hexagons 10heptagons 7octagons 2undecagons

Polygon Models: Others

Faces and Corners: Sandal

Fewer polygons  less connectivity information Fewer polygons  less connectivity information Polygons tend to be planar & convex  better geometry prediction Polygons tend to be planar & convex  better geometry prediction Better triangle strips Better triangle strips Do not triangulate!

Group Structures: Teapot & Cow

Group Structures: Others

Overview Do not triangulate! Do not triangulate! Connectivity Compression for Manifold Polygon Meshes Connectivity Compression for Manifold Polygon Meshes Compact mesh representations Simple implementation Beyond Faces: Quadrilateral grids Capture Structures! Capture Structures!

Previous Work

Fast Rendering Fast Rendering Progressive Transmission Progressive Transmission Maximum Compression Maximum Compression

Previous Work Fast Rendering Fast Rendering Progressive Transmission Maximum Compression graphics boardmain memory

Previous Work Fast Rendering Fast Rendering Progressive Transmission Maximum Compression Triangle Strips [?] Generalized Triangle Mesh[ Deering ] Transparent Vertex Caching[ Hoppe, n VIDIA ]

Previous Work Fast Rendering Progressive Transmission Progressive Transmission Maximum Compression Maximum Compression main memorystorage / network

Previous Work Fast Rendering Progressive Transmission Progressive Transmission Maximum Compression Progressive Meshes [ Hoppe ] Progressive Forest Split[ Taubin et ] Compressed Progressive Meshes[ Pajarola et ] Progressive Geometry Compression [ Khodakovsky et ]

Previous Work Fast Rendering Progressive Transmission Maximum Compression Maximum Compression Topological Surgery [ Taubin, Rossignac ] Triangle Mesh Compression[ Costa, Gotsman ] Edgebreaker[ Rossignac, King et ] Cut-border Machine[ Gumhold, Strasser ]

ver 1 (x,y,z) ver 2 (x,y,z) ver 3 (x,y,z) ver n Standard Mesh Representation face face face face m connectivity n = 10, KB60 KB n = 100, KB600 KB n = 1,000, MB6 MB geometry

ver 1 (x,y,z) ver 2 (x,y,z) ver 3 (x,y,z) ver n Standard Mesh Representation face face face face m nor 1 (x,y,z) nor 2 (x,y,z) nor 3 (x,y,z) nor i tex 1 (u,v) tex 2 (u,v) tex 3 (u,v) tex k col 1 (r,g,b) col 2 (r,g,b) col 3 (r,g,b) col j

Face Fixer

encoding is a sequence of labels: encoding is a sequence of labels: one label.... per face one label per hole one label per handle labels and fix it all together number of labels = number of edges number of labels = number of edges reverse decoding reverse decoding Face Fixer F4F4 F5F5 R F3F3 LS E HnHn M

Encoding

F4F4

F4F4 F3F3

F4F4 F3F3 R

F4F4 F3F3 F5F5 R

F4F4 F3F3 F5F5 R F5F5

F4F4 F3F3 F5F5 R F5F5 R

F4F4 F3F3 F5F5 R F5F5 R R

Compressing Resulting label sequence: Resulting label sequence: non-uniform label frequencies correlation among subsequent labels Adaptive order-3 arithmetic coding Adaptive order-3 arithmetic coding Compact probability tables Fast bit-operations F4F4 F3F3 F5F5 R F5F5 R F4F4... RR F4F4 R

Decoding R

R

F5F5

F5F5

R

F3F3

F4F4

+2.0 TG Compression Results Triceratops2.1 Galleon2.6 Cessna2.8 Beethoven2.9 Shark1.7 Cupie2.3 bits vertex model

fragmented disks half-disk disk Non-Manifold Meshes (1)

Non-Manifold Meshes (2) cut

Beyond Faces

Extension: Quadrilateral Grids

Encoding a Quad Grid right left height

Encoding a Quad Grid QG

Triceratops Galleon Beethoven Shark Teapot Trumpet bits vertex model Compression with Quad Grids diff

Extension: Repeated Patches

Structures

Extension: Structures

case D case B case A case C Super Faces connected by an edge connected by a vertex

Encoding a Super Face

SF

Encoding a Super Face

F4F4

F4F4 F3F3

F4F4 F3F3 R

F4F4 F3F3 R F5F5

F4F4 F3F3 R F5F5 R

F4F4 F3F3 R F5F5 R R

F4F4 F3F3 R F5F5 R R F3F3

F4F4 F3F3 R F5F5 R R F3F3 R

Compression with Structures bits vertex model diff Triceratops Galleon Cessna Beethoven Shark Cupie

Summary

Summary of Contributions Compress polygonal connectivity Compress polygonal connectivity simpler, more compact, extensions Capture structural information Capture structural information face groupings mesh partitions discontinuity curves Model Libraries Model Libraries “rich” meshes storage / network transmission

Current and Future Work Triangle Strip Compression Graphics Interface 2000 Triangle Strip Compression Graphics Interface 2000 Tetrahedral and Hexahedral meshes  “cell fixer” Tetrahedral and Hexahedral meshes  “cell fixer”

Acknowledgements Davis King Jarek Rossignac Mike Maniscalco Stefan Gumhold S 6 Viewpoint Datalabs

Thank you.

Regular  Irregular Connectivity Re-meshable Re-meshable Bunnies, Horses, various Roman Statues, … Highly detailed, dense, scanned data sets Not Re-meshable Not Re-meshable Cessnas, Spanish Galleons, Sandals, … Careful designed meshes with sharp features CAD models, Viewpoint models

Predictive Coding good not convex  bad not planar  bad

Attaching Geometry