face fixer compressing polygon meshes with properties martin isenburg jack snoeyink university of...

72

Post on 20-Dec-2015

232 views

Category:

Documents


0 download

TRANSCRIPT

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

Face FixerFace FixerCompressing Polygon MeshesCompressing Polygon Meshes

with Propertieswith Properties

Martin Isenburg Jack SnoeyinkMartin Isenburg Jack Snoeyink

University of North Carolina at Chapel HillUniversity of North Carolina at Chapel Hill

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

Polygon Models: Triceratops

356356 trianglestriangles22662266 quadranglesquadrangles

140140 pentagonspentagons6363 hexagonshexagons1010 heptagonsheptagons

77 octagonsoctagons22 undecagonsundecagons

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

Polygon Models: Others

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

Faces and Corners: Sandal

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

• Fewer polygonsFewer polygons less connectivity information less connectivity information

• Polygons tend to be planar & convexPolygons tend to be planar & convex better geometry prediction better geometry prediction

• Better triangle stripsBetter triangle strips

Do not triangulate!

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

Group Structures: Teapot & Cow

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

Group Structures: Others

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

Overview

• Do not triangulate!Do not triangulate!

• Connectivity Compression for Manifold Connectivity Compression for Manifold Polygon MeshesPolygon Meshes• Compact mesh representations

• Simple implementation

• Beyond Faces: Quadrilateral grids

• Capture Structures!Capture Structures!

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

Previous WorkPrevious Work

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

Previous Work

• Fast RenderingFast Rendering

• Progressive TransmissionProgressive Transmission

• Maximum CompressionMaximum Compression

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

Previous Work

• Fast RenderingFast Rendering

• Progressive Transmission

• Maximum Compression

graphics boardmain memory

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

Previous Work

• Fast RenderingFast Rendering

• Progressive Transmission

• Maximum Compression

• Triangle Strips [?]

• Generalized Triangle Mesh [Deering]

• Transparent Vertex Caching [Hoppe,nVIDIA]

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

Previous Work

• Fast Rendering

• Progressive TransmissionProgressive Transmission

• Maximum CompressionMaximum Compression

main memorystorage / network

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

Previous Work

• Fast Rendering

• Progressive TransmissionProgressive Transmission

• Maximum Compression

• Progressive Meshes [Hoppe]

• Progressive Forest Split [Taubin et]

• Compressed Progressive Meshes [Pajarola et]

• Progressive Geometry Compression [Khodakovsky et]

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

Previous Work

• Fast Rendering

• Progressive Transmission

• Maximum CompressionMaximum Compression

• Topological Surgery [Taubin, Rossignac]

• Triangle Mesh Compression [Costa, Gotsman]

• Edgebreaker [Rossignac, King et]

• Cut-border Machine [Gumhold, Strasser]

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

ver1 (x,y,z)ver2 (x,y,z)ver3 (x,y,z)

vern

Standard Mesh Representation

face1 1 2 3 4face2 3 4 3face3 5 2 1 3

facem

connectivity

n = 10,000 66 KB 60 KBn = 100,000 830 KB 600 KB

n = 1,000,000 10 MB 6 MB

geometry

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

ver1 (x,y,z)ver2 (x,y,z)ver3 (x,y,z)

vern

Standard Mesh Representation

face1 1 2 3 4face2 3 4 3face3 5 2 1 3

facem

nor1 (x,y,z)nor2 (x,y,z)nor3 (x,y,z)

nori

tex1 (u,v)tex2 (u,v)tex3 (u,v)

texk

col1 (r,g,b)col2 (r,g,b)col3 (r,g,b)

colj

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

Face FixerFace Fixer

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

Face Fixer

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

• 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 edgesnumber of labels = number of edges

• reverse decodingreverse decoding

Face Fixer

F4 F5

R

F3

L S E

Hn

M

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

Encoding

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

Encoding

F4

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

Encoding

F4

F3

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

Encoding

F4

F3

R

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

Encoding

F4

F3F5

R

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

Encoding

F4

F3F5

R

F5

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

Encoding

F4

F3F5

R

F5

R

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

Encoding

F4

F3F5

R

F5

R R

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

Compressing

• Resulting label sequence:Resulting label sequence:

• non-uniform label frequencies

• correlation among subsequent labels

• Adaptive order-3 arithmetic codingAdaptive order-3 arithmetic coding• Compact probability tables

• Fast bit-operations

F4 F3 F5R F5 R F4. . . R RF4 R . . .

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

Decoding

R

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

Decoding

R

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

Decoding

F5

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

Decoding

F5

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

Decoding

R

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

Decoding

F3

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

Decoding

F4

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

Decoding

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

+2.0 +2.0

TG

2.2

2.4

Compression Results

Triceratops 2.1Galleon 2.6Cessna 2.8

Beethoven 2.9Shark 1.7Cupie 2.3

bitsvertexmodel

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

fragmented disks

half-diskdisk

Non-Manifold Meshes (1)

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

Non-Manifold Meshes (2)

cutcut

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

Beyond FacesBeyond Faces

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

Extension: Quadrilateral Grids

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

Encoding a Quad Grid

right

left

height

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

Encoding a Quad Grid

QG

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

Triceratops 1.9 -0.2Galleon 2.2 -0.4

Beethoven 2.6 -0.3Shark 1.4 -0.3Teapot 1.1 -0.6

Trumpet 0.6 -0.5

bitsvertexmodel

Compression with Quad Grids

diff

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

Extension: Repeated Patches

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

StructuresStructures

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

Extension: Structures

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

case D

case Bcase A

case C

Super Faces

connected by anedge

connected by avertex

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

Encoding a Super Face

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

Encoding a Super Face

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

Encoding a Super Face

SF

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

Encoding a Super Face

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

Encoding a Super Face

F4

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

Encoding a Super Face

F4

F3

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

Encoding a Super Face

F4

F3

R

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

Encoding a Super Face

F4

F3

R

F5

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

Encoding a Super Face

F4

F3

R

F5 R

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

Encoding a Super Face

F4

F3

R

F5 R

R

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

Encoding a Super Face

F4

F3

R

F5 R

RF3

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

Encoding a Super Face

F4

F3

R

F5 R

RF3

R

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

+0.1+0.1+0.2+0.1+0.0+0.1

Compression with Structures

bitsvertexmodel diff

Triceratops 2.4 +0.3Galleon 2.7 +0.1Cessna 3.5 +0.7

Beethoven 3.0 +0.1Shark 2.0 +0.3Cupie 2.3 +0.1

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

SummarySummary

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

Summary of Contributions

• Compress polygonal connectivityCompress polygonal connectivity• simpler, more compact, extensions

• Capture structural informationCapture structural information• face groupings

• mesh partitions

• discontinuity curves

• Model LibrariesModel Libraries• “rich” meshes

• storage / network transmission

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

Current and Future Work

• Triangle Strip CompressionTriangle Strip Compression Graphics Interface 2000Graphics Interface 2000

• Tetrahedral and Hexahedral meshes Tetrahedral and Hexahedral meshes “cell fixer”“cell fixer”

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

Acknowledgements

Davis KingDavis King

Jarek RossignacJarek Rossignac

Mike ManiscalcoMike Maniscalco

Stefan GumholdStefan Gumhold

SS66

Viewpoint DatalabsViewpoint Datalabs

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

Thank you.Thank you.

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

Regular Irregular Connectivity

• Re-meshableRe-meshable• Bunnies, Horses, various Roman Statues, …

• Highly detailed, dense, scanned data sets

• Not Re-meshableNot Re-meshable• Cessnas, Spanish Galleons, Sandals, …

• Careful designed meshes with sharp features

• CAD models, Viewpoint models

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

Predictive Coding

good not convex bad not planar bad

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

Attaching Geometry