1 / 72

Face Fixer Compressing Polygon Meshes with Properties

Face Fixer Compressing Polygon Meshes with Properties. Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill. 356 triangles 2266 quadrangles 140 pentagons 63 hexagons 10 heptagons 7 octagons 2 undecagons. Polygon Models: Triceratops. Polygon Models: Others.

colby-fox
Download Presentation

Face Fixer Compressing Polygon Meshes with Properties

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. Face FixerCompressing Polygon Mesheswith Properties Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill

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

  3. Polygon Models: Others

  4. Faces and Corners: Sandal

  5. Do nottriangulate! • Fewer polygons less connectivity information • Polygons tend to be planar & convex better geometry prediction • Better triangle strips

  6. Group Structures: Teapot & Cow

  7. Group Structures: Others

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

  9. Previous Work

  10. Previous Work • Fast Rendering • Progressive Transmission • Maximum Compression

  11. Previous Work • Fast Rendering • Progressive Transmission • Maximum Compression main memory graphics board

  12. Previous Work • Fast Rendering • Progressive Transmission • Maximum Compression • Triangle Strips [?] • Generalized Triangle Mesh [Deering] • Transparent Vertex Caching [Hoppe,nVIDIA]

  13. Previous Work • Fast Rendering • Progressive Transmission • Maximum Compression storage / network main memory

  14. Previous Work • Fast Rendering • Progressive Transmission • Maximum Compression • Progressive Meshes [Hoppe] • Progressive Forest Split [Taubin et] • Compressed Progressive Meshes [Pajarola et] • Progressive GeometryCompression [Khodakovsky et]

  15. 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]

  16. connectivity geometry n = 10,000 66 KB 60 KB n = 100,000 830 KB 600 KB n = 1,000,000 10 MB 6 MB Standard Mesh Representation face1 1 2 3 4 face2 3 4 3 face3 5 2 1 3 facem ver1 (x,y,z) ver2 (x,y,z) ver3 (x,y,z) vern

  17. nor1 (x,y,z) nor2 (x,y,z) nor3 (x,y,z) nori col1 (r,g,b) col2 (r,g,b) col3 (r,g,b) colj tex1 (u,v) tex2 (u,v) tex3 (u,v) texk Standard Mesh Representation face1 1 2 3 4 face2 3 4 3 face3 5 2 1 3 facem ver1 (x,y,z) ver2 (x,y,z) ver3 (x,y,z) vern

  18. Face Fixer

  19. Face Fixer

  20. R F4 L S E F5 F3 M Hn 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

  21. Encoding

  22. F4 Encoding

  23. F4 F3 Encoding

  24. R F4 F3 Encoding

  25. R F4 F5 F3 Encoding

  26. R F4 F5 F5 F3 Encoding

  27. R R F4 F5 F5 F3 Encoding

  28. R R R F4 F5 F5 F3 Encoding

  29. R R R R R F4 F4 F4 F5 F5 F3 Compressing • Resulting label sequence: • non-uniform label frequencies • correlation among subsequent labels • Adaptive order-3 arithmetic coding • Compact probability tables • Fast bit-operations . . . . . .

  30. R Decoding

  31. R Decoding

  32. F5 Decoding

  33. F5 Decoding

  34. R Decoding

  35. F3 Decoding

  36. F4 Decoding

  37. Decoding

  38. bits vertex Compression Results TG 2.2 2.4 model Triceratops2.1 Galleon 2.6 Cessna 2.8 Beethoven 2.9 Shark 1.7 Cupie 2.3 +2.0 +2.0

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

  40. cut cut Non-Manifold Meshes (2)

  41. Beyond Faces

  42. Extension: Quadrilateral Grids

  43. height left right Encoding a Quad Grid

  44. QG Encoding a Quad Grid

  45. bits vertex Compression with Quad Grids diff model Triceratops1.9 -0.2 Galleon 2.2 -0.4 Beethoven 2.6 -0.3 Shark 1.4 -0.3 Teapot 1.1 -0.6 Trumpet 0.6 -0.5

  46. Extension: Repeated Patches

  47. Structures

  48. Extension: Structures

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

More Related