Tutorial Mesh Processing Bruno Lévy INRIA - ALICE.

Slides:



Advertisements
Similar presentations
Mesh Parameterization: Theory and Practice Setting the Boundary Free Mesh Parameterization: Theory and Practice Setting the Boundary Free Bruno Lévy -
Advertisements

Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Application of Angle-Preserving Parameterization: Remeshing.
Discrete Exterior Calculus. More Complete Introduction See Chapter 7 “Discrete Differential Forms for Computational Modeling” in the SIGGRAPH 2006 Discrete.
Chapter 12 and Chapter 3 Geometry Terms.
Geometry Chapter Polygons. Convex Polygon – a polygon with a line containing a side with a point in the interior of the polygon.
2D/3D Shape Manipulation, 3D Printing
School of Computer Science University of Seoul. Mostly handles orientable 2-manifold Composed of triangles, quads, polygons, etc. Comes with Topology.
Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
1 Terrain. Game Type Oriented Game Type Oriented Terrain Terrain –For visual ( 廣義的場景 ) »Ground / Building / Static models / Dynamic models –For terrain.
The Half-Edge Data Structure Computational Geometry, WS 2007/08 Lecture 3, Part III Prof. Dr. Thomas Ottmann Khaireel A. Mohamed Algorithmen & Datenstrukturen,
The Half-Edge Data Structure
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
CENG 789 – Digital Geometry Processing 01- Introduction Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Max-Plank Institut für Informatik systematic error parallelogram rule polygonal rules exact prediction Geometry Prediction for High Degree Polygons Martin.
CS CS 175 – Week 7 Parameterization Linear Methods.
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
Lossless Compression of Floating-Point Geometry Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Jack Snoeyink UNC Chapel Hill.
Robust Adaptive Meshes for Implicit Surfaces Afonso Paiva Hélio Lopes Thomas Lewiner Matmidia - Departament of Mathematics – PUC-Rio Luiz Henrique de Figueiredo.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
FiberMesh: Designing Freeform Surfaces with 3D Curves
Spectral Processing of Point-sampled Geometry
Martin Isenburg UC Berkeley Streaming Meshes Peter Lindstrom LLNL.
CENG 789 – Digital Geometry Processing 02- Mesh Data Structures Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Out-of-Core Compression for Gigantic Polygon Meshes Martin IsenburgStefan Gumhold University of North CarolinaWSI/GRIS at Chapel Hill Universität Tübingen.
INTECH’ April, the 28 th 2005 Mesh Parameterization Bruno Lévy, INRIA, project ALICE INTECH’ April, the 28 th 2005 Mesh Parameterization Bruno Lévy, INRIA,
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
Parameterization.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
Geometry. Some more definitions: Geometry Some more definitions: Consecutive vertices:
SIGGRAPH 2010 “Spectral Mesh Processing” Bruno Lévy and Richard Hao Zhang.
Point Set Processing and Surface Reconstruction (
Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Monday, October 12, 2015Sibgrapi Natal1 CHF: A Scalable Topological Data.
Mesh Data Structure. Meshes Boundary edge: adjacent to 1 face Regular edge: adjacent to 2 faces Singular edge: adjacent to >2 faces Mesh: straight-line.
Surface Simplification Using Quadric Error Metrics Garland & Heckbert Siggraph 97.
1 Triangle Surfaces with Discrete Equivalence Classes Published in SIGGRAPH 2010 報告者 : 丁琨桓.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Line Segment Intersection Computational Geometry, WS 2006/07 Lecture 3 – Part III Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
1 Wavelets on Surfaces By Samson Timoner May 8, 2002 (picture from “Wavelets on Irregular Point Sets”) In partial fulfillment of the “Area Exam” doctoral.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Level of Detail Management for Games David Luebke University of Virginia Introduction, Overview.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
MECH4450 Introduction to Finite Element Methods Chapter 9 Advanced Topics II - Nonlinear Problems Error and Convergence.
Simple Quad Domains for Field Aligned Mesh Parametrization Marco Tarini Enrico Puppo Daniele Panozzo Nico Pietroni Paolo Cignoni Visual Computing Lab ISTI-CNR,
3D Polyhedral Surfaces in Pierre Alliez.
Designing Quadrangulations with Discrete Harmonic Forms
Mesh Sekeltonization פרויקט סוף תואר איל רז מנחה – ג ' יהאד אל - סנה.
Do Now. Section 8.2 Angles in Polygons Polygon Interior Angles Theorem The sum of the measures of the interior angles of a convex polygon with n sides.
ECCV Tutorial Mesh Processing Discrete Exterior Calculus
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
Pairs of Angles Geometry Farris O I can identify adjacent, vertical, complementary, and supplementary angles. I can find measures of pairs of angles.
3-D Mesh Morphing By Newton Der.
1 Global Structure Optimization of Quadrilateral Meshes Published in Eurographics 2011 報告者 : 丁琨桓.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
CENG 789 – Digital Geometry Processing 04- Mesh Data Structures
Max-Cut a b Edges cut: 8 w c d e 1.
AMS 345/CSE 355 Computational Geometry
Limits – Graphically and Numerically
Simplification of Articulated Mesh
05 Geodesics on Meshes jjcao Based on the idea of Professor Ligang Liu.
Practice Geometry Practice
Presentation transcript:

Tutorial Mesh Processing Bruno Lévy INRIA - ALICE

Overview Motivations Digital Michelangelo Stanford University

Overview A large domain Mesh Processing: a wide topic Data structures Mesh repair Mesh analysis SmoothingParameterization Mesh simplification Remeshing Freeform modeling... SIGGRAPH and EUROGRAPHICS tutorials (with M. Botsch, M. Pauly, L. Kobbelt and P. Alliez)

Overview This tutorial 1. Introduction 2. Differential Geometry on Meshes Mesh Parameterization 3. Functions on Meshes Discrete Exterior Calculus h h50: Coffee Break Spectral Mesh Processing 5. Numerics

1. Introduction n Need for efficient data structures Iterate on vertices, edges, polygons

1. Introduction n Need for efficient data structures Incidence relations

1. Introduction n Need for efficient data structures Inverse incidence relations

1. Introduction half-edges half-edges

1. Introduction struct Halfedge { Halfedge* next ; Halfedge* next ; Halfedge* opposite ; Halfedge* opposite ; Facet* facet ; Facet* facet ; Vertex* vertex ; Vertex* vertex ; } ;

1. Introduction struct Vertex { Halfedge* halfedge ; Halfedge* halfedge ; Point3d point ; Point3d point ; } ; struct Facet { Halfedge* halfedge ; Halfedge* halfedge ; } ;

1. Introduction n Graphite n CGAL n OpenMesh See

Overview This tutorial 1. Introduction 2. Differential Geometry on Meshes Mesh Parameterization 3. Functions on Meshes Discrete Exterior Calculus h h50: Coffee Break Spectral Mesh Processing 5. Numerics