Efficient Edgebreaker for surfaces of arbitrary topology

Slides:



Advertisements
Similar presentations
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
Advertisements

1/23 Vector field reconstruction from sparse samples with applications Marcos Lage, Fabiano Petronetto, Afonso Paiva, Hélio Lopes, Thomas Lewiner and Geovan.
3D Compression, SM’02 1Jarek Rossignac, GVU Center, Georgia Tech1: T-meshes Triangle meshes Jarek Rossignac GVU Center and College of Computing Georgia.
Consistent Spherical Parameterization Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
Angle-Analyzer: A Triangle-Quad Mesh Codec Haeyoung Lee USC Mathieu Desbrun USC Pierre Alliez INRIA.
March 2, D Mesh Coding and Transmission Lihang Ying Department of Computing Science University of Alberta.

Spherical Parameterization and Remeshing Emil Praun, University of Utah Hugues Hoppe, Microsoft Research.
Compressing Texture Coordinates Martin IsenburgJack Snoeyink University of North Carolina at Chapel Hill with h Selective Linear Predictions.
Cutting a surface into a Disk Jie Gao Nov. 27, 2002.
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.
Parallel Simulations of Fracture and Fragmentation I. Arias, J. Knap and M. Ortiz California Institute of Technology Figure 1. The tractions at each side.
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.
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.
Robust Adaptive Meshes for Implicit Surfaces Afonso Paiva Hélio Lopes Thomas Lewiner Matmidia - Departament of Mathematics – PUC-Rio Luiz Henrique de Figueiredo.
Compressing the Property Mapping of Polygon Meshes Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill.
Compressing Polygon Mesh Connectivity
Vieira et al. - Fast Stellar Mesh Simplification 1 Fast Stellar Mesh Simplification Antônio W. Vieira 1,2 Luiz Velho 3 Hélio Lopes 1 Geovan Tavares 1 Thomas.
Space Efficient Point Location forTriangulations.
Towards Topology-Rich Visualization Attila Gyulassy SCI Institute, University of Utah.
Martin Isenburg UC Berkeley Jack Snoeyink UNC Chapel Hill Early Split Coding of Triangle Mesh Connectivity.
University of British Columbia Compressing Connectivity.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
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.
Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
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.
Socorro G.V. (1), Ruiz-Gironés E. (2), Oliver A. (1), Cascón J.M. (3), Escobar J.M. (1), Sarrate J. (2) and Montenegro R. (1) CMN June 29 – July.
05 Edgebreaker, 1 Jarek Rossignac, CoC & GVU Center, Georgia Tech SM, June 2002 Edgebreaker (EB) Second generation 3D compression Faster, simpler, more.
1 MESHCOMPRESSIONMESHCOMPRESSION EG99 Tutorial Mesh Compression.
Compressing Multiresolution Triangle Meshes Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo Department of Computer and Information Sciences.
GVU Center and College of Computing
Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal1 CHF: A Scalable Topological Data.
A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies Tae-Joon Kim Bochang Moon Duksu Kim Sung-Eui Yoon KAIST (Korea Advanced Institute of.
Random-Accessible Compressed Triangle Meshes Sung-eui Yoon Korea Advanced Institute of Sci. and Tech. (KAIST) Peter Lindstrom Lawrence Livermore National.
Click to edit Master title style HCCMeshes: Hierarchical-Culling oriented Compact Meshes Tae-Joon Kim 1, Yongyoung Byun 1, Yongjin Kim 2, Bochang Moon.
Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.
1 Compressing TINs Leila De Floriani, Paola Magillo University of Genova Genova (Italy) Enrico Puppo National Research Council Genova (Italy)
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,
Nets and Surface Area – Draw two-dimensional models for three-dimensional figures. – Find surface area. Designers use wind tunnels to study the shapes.
Riccardo Fellegara University of Genova Genova, Italy
MINGLE Mid-Term Meeting (June 26, 2002)1 DISI - University of Genova Leila De Floriani MINGLE Mid-Term Meeting St. Malo, June 26, 2002.
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.
Delaunay Triangulations and Control-Volume Meshing Michael Murphy.
Rossignac, Szymczak, King, Safonova
Surface Approximation with Triangle Meshes
3D Object Representations
A Brief History of 3D MESH COMPRESSION ORAL, M. ELMAS, A.A.
Rainbow cycles in flip graphs
Non-manifold Multiresolution Modeling (some preliminary results)
IEEE INFOCOM 2015 SURF: A Connectivity-based Space Filling Curve Construction Algorithm in High Genus 3D Surface WSNs Chen Wang and Hongbo Jiang Huazhong.
Jarek Rossignac GVU Center Georgia Institute of Technology
Extensions to Edgebreaker
Topological Ordering Algorithm: Example
Progressive coding Motivation and goodness measures
Topological Ordering Algorithm: Example
Iso-Surface extraction from red and green samples on a regular lattice
Boolean Operations for Free-form Models Represented in Geometry Images
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Presentation transcript:

Efficient Edgebreaker for surfaces of arbitrary topology Thomas Lewiner1,2 , Hélio Lopes1, Jarek Rossignac3 and Antônio Wilson Vieira1,4 1PUC-Rio — Departamento de Matemática 2INRIA — Géométrica Project (France) 3GATECH — Atlanta 4UNIMONTES — Montes Claros SIBGRAPI - SIACG 2004 December 5, 2018December 5, 2018

Motivation Different 3D model generations One efficient compression algorithm. SIBGRAPI - SIACG 2004

Compression Connectivity: 228 Kb Topology: 1.53 Kb Geometry: 2.33 Mb -0.0071 0.064825 -0.047272 -0.004643 0.064825 -0.04728 -0.004239 0.064825 -0.047272 -0.007875 0.065075 -0.047272 -0.007643 0.06503 -0.047272 -0.007143 0.065075 -0.0473 -0.003702 0.065075 -0.047272 -0.008394 0.065325 -0.047275 ……………………… 3 70 81 1 3 4 3 12 3 72 4 0 3 77 76 17 3 2 19 6 3 85 70 2 3 9 8 7 3 7 10 9 CCCRCCCCCCC RCRCCCCCRRC CCCCCCCRCCR CRCCRCRCCCC CCCCRRRLCRC RCCCRCCCRSL ECRCCCCCCRC RCCCRCRSER… Connectivity: 228 Kb Topology: 1.53 Kb Geometry: 2.33 Mb 543,652 triangles 1,087,716 vertices PLY: 55.6 Mb ZIP : 16.0 Mb Total: 2.55 Mb SIBGRAPI - SIACG 2004

Outline Edgebreaker compression → CLERS string Mesh and graphs → primal remainder Handles compression → boundaries compression SIBGRAPI - SIACG 2004

Edgebreaker Topological Surgery Taubin & Rossignac, ACM ToGs 1998 Edgebreaker Rossignac, IEEE TVCG 1999 Spirale Reversi Isenburg & Snoeyink, CCG 2000 Edgebreaker with Handles Lopes et al., C&G 2003 SIBGRAPI - SIACG 2004

CLERS codes SIBGRAPI - SIACG 2004

Example: Tetrahedron P C R E SIBGRAPI - SIACG 2004

Spherical Meshes Dual Tree → Primal Tree (χ = V – E = 1) (χ = 1) χ = V – E + F= 2 SIBGRAPI - SIACG 2004

General Meshes Orientable combinatorial manifolds: χ = V – E + F without boundary, genus g: χ = 2 – 2g with b boundaries, genus g : χ = 2 – 2g – b SIBGRAPI - SIACG 2004

Primal Remainder χ = 2 – 2g – b Dual Tree → Primal Remainder SIBGRAPI - SIACG 2004

Surfaces with Genus Explicitly encodes the 2g cycling edges of the primal remainder SIBGRAPI - SIACG 2004

Example: Torus C R L S S* E SIBGRAPI - SIACG 2004

Example: Torus Explicitly encodes the 2g cycling edges (in red) of the primal remainder SIBGRAPI - SIACG 2004

Surfaces with Boundaries External boundary implicitly encoded Explicitly encodes the 2g – b cycling edges of the primal remainder SIBGRAPI - SIACG 2004

Results Better entropy and rate Separate topology representation SIBGRAPI - SIACG 2004

Extensions Faster decompression Non-triangular mesh Improve the arithmetic coder Tetrahedral meshes SIBGRAPI - SIACG 2004

Thank you! SIBGRAPI - SIACG 2004 December 5, 2018December 5, 2018