SIGGRAPH 2000

1
(No Transcript)
2
Face FixerCompressing Polygon Mesheswith
Properties

• Martin Isenburg Jack Snoeyink
• University of North Carolina at Chapel Hill

3
Polygon Models Triceratops
4
Polygon Models Others
5
Faces and Corners Sandal
6
Do not triangulate!

• Fewer polygons ? less connectivity information
• Polygons tend to be planar convex ? better
  geometry prediction
• Better triangle strips

7
Group Structures Teapot Cow
8
Group Structures Others
9
Overview

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

10

• Previous Work

11
Previous Work

• Fast Rendering
• Progressive Transmission
• Maximum Compression

12
Previous Work

• Fast Rendering
• Progressive Transmission
• Maximum Compression

graphics board
main memory
13
Previous Work

• Fast Rendering
• Progressive Transmission
• Maximum Compression
• Triangle Strips ?
• Generalized Triangle Mesh Deering
• Transparent Vertex Caching Hoppe,nVIDIA

14
Previous Work

• Fast Rendering
• Progressive Transmission
• Maximum Compression

main memory
storage / network
15
Previous Work

• Fast Rendering
• Progressive Transmission
• Maximum Compression
• Progressive Meshes Hoppe
• Progressive Forest Split Taubin et
• Compressed Progressive Meshes Pajarola et
• Progressive Geometry Compression Khodakovsky et

16
Previous Work

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

17
Standard Mesh Representation
ver1 (x,y,z) ver2 (x,y,z) ver3 (x,y,z) vern
face1 1 2 3 4 face2 3 4 3 face3 5 2 1
3 facem
18
Standard Mesh Representation
ver1 (x,y,z) ver2 (x,y,z) ver3 (x,y,z) vern
face1 1 2 3 4 face2 3 4 3 face3 5 2 1
3 facem
19

• Face Fixer

20
Face Fixer
21
Face Fixer

• 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
• reverse decoding

22
Encoding





























23
Encoding































24
Encoding































25
Encoding






























26
Encoding

































27
Encoding


































28
Encoding

































29
Encoding
































30
Compressing

• Resulting label sequence
• non-uniform label frequencies
• correlation among subsequent labels
• Adaptive order-3 arithmetic coding
• Compact probability tables
• Fast bit-operations

. . .
. . .
31
Decoding



























32
Decoding





























33
Decoding































34
Decoding






























35
Decoding



























36
Decoding





























37
Decoding





























38
Decoding



























39
Compression Results
TG 2.2 2.4
model
2.0 2.0
Triceratops 2.1 Galleon 2.6 Cessna 2.8 Bee
thoven 2.9 Shark 1.7 Cupie 2.3
40
Non-Manifold Meshes (1)



















41
Non-Manifold Meshes (2)





















42

• Beyond Faces

43
Extension Quadrilateral Grids
44
Encoding a Quad Grid





























45
Encoding a Quad Grid





































46
Compression with Quad Grids
diff
model
Triceratops 1.9 -0.2 Galleon 2.2 -0.4 Beethov
en 2.6 -0.3 Shark 1.4 -0.3 Teapot 1.1 -0.6 Trum
pet 0.6 -0.5
47
Extension Repeated Patches
48

• Structures

49
Extension Structures
50
Super Faces




case B
case A






















































case D
case C












































51
Encoding a Super Face
























52
Encoding a Super Face

























53
Encoding a Super Face






























54
Encoding a Super Face














55
Encoding a Super Face














56
Encoding a Super Face














57
Encoding a Super Face














58
Encoding a Super Face














59
Encoding a Super Face














60
Encoding a Super Face














61
Encoding a Super Face














62
Encoding a Super Face














63
Compression with Structures
diff
model
Triceratops 2.4 0.3 Galleon 2.
7 0.1 Cessna 3.5 0.7 Beethoven 3.0 0.1 Shark
2.0 0.3 Cupie 2.3 0.1
0.1 0.1 0.2 0.1 0.0 0.1
64

• Summary

65
Summary of Contributions

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

66
Current and Future Work

• Triangle Strip Compression Graphics Interface
  2000
• Tetrahedral and Hexahedral meshes ? cell fixer

67
Acknowledgements

• Davis King
• Jarek Rossignac
• Mike Maniscalco
• Stefan Gumhold
• S6
• Viewpoint Datalabs

68

• Thank you.

69
(No Transcript)
70
Regular ? Irregular Connectivity

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

71
Predictive Coding




72
Attaching Geometry