Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow.

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

CISC 489/689 Spring 2009 University of Delaware
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
L1 sparse reconstruction of sharp point set surfaces
Surface normals and principal component analysis (PCA)
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Morphing & Warping 2D Morphing Involves 2 steps 1.Image warping “get features to line up” 2.Cross-dissolve “mix colors” (fade-in/fadeout transition)
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
2D/3D Shape Manipulation, 3D Printing
1 Curves and Surfaces. 2 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized.
1 Free-Form Deformations Dr. Scott Schaefer. 2/28 Deformation.
1Notes. 2 Building implicit surfaces  Simplest examples: a plane, a sphere  Can do unions and intersections with min and max  This works great for.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Total Recall Math, Part 2 Ordinary diff. equations First order ODE, one boundary/initial condition: Second order ODE.
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
CS CS 175 – Week 4 Triangle Mesh Smoothing Signal Processing, Diffusion, Curvature Flow.
Interactive Animation of Structured Deformable Objects Mathieu Desbrun Peter Schroder Alan Barr.
Biomedical signal processing: Wavelets Yevhen Hlushchuk, 11 November 2004.
CSCE 641 Computer Graphics: Image Filtering & Feature Detection Jinxiang Chai.
Polygonal Mesh – Data Structure and Smoothing
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Content Subdivision First some basics (control point polygon, mesh)
FiberMesh: Designing Freeform Surfaces with 3D Curves
1 ECE 3336 Introduction to Circuits & Electronics MORE on Operational Amplifiers Spring 2015, TUE&TH 5:30-7:00 pm Dr. Wanda Wosik Set #14.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Computational Photography: Image Processing Jinxiang Chai.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2014.
Laplacian Surface Editing
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Finite Differences Finite Difference Approximations  Simple geophysical partial differential equations  Finite differences - definitions  Finite-difference.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Spline curves 1/23 Curves and Surfaces.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
Discontinuous Galerkin Methods and Strand Mesh Generation
INFORMATIK Mesh Smoothing by Adaptive and Anisotropic Gaussian Filter Applied to Mesh Normals Max-Planck-Institut für Informatik Saarbrücken, Germany Yutaka.
Lecture 6 : Level Set Method
GPU-Accelerated Surface Denoising and Morphing with LBM Scheme Ye Zhao Kent State University, Ohio.
Discontinuous Galerkin Methods for Solving Euler Equations Andrey Andreyev Advisor: James Baeder Mid.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2013.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Figure 8.2, A voltage amplifier Figure 8.2 Simple voltage amplifier model Figure 8.3 Please see pages 410~412 Eq. 8.1~ 8.8.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
Spectral Compression of Mesh Geometry (Karni and Gotsman 2000) Presenter: Eric Lorimer.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Blood Vessel Modeling using 2D/3D Level Set Method
CSE554FairingSlide 1 CSE 554 Lecture 6: Fairing Fall 2015.
Zl1 A sharpness dependent filter for mesh smoothing Chun-Yen Chen Kuo-Young Cheng available in CAGD Vol.22. 5(2005)
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
04/18/02(c) 2002 University of Wisconsin Last Time Hermite Curves Bezier Curves.
Bilateral Mesh Denoising Shachar Fleishman Iddo Drori Daniel Cohen-Or Tel Aviv University.
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Computing & Information Sciences Kansas State University Lecture 31 of 42CIS 636/736: (Introduction to) Computer Graphics Lecture 32 of 42 Wednesday, 11.
Leo Lam © Signals and Systems EE235 KX5BQY.
Instructor: Mircea Nicolescu Lecture 7
CIVET seminar Presentation day: Presenter : Park, GilSoon.
High Performance Computing Seminar
CHAPTER 2 - EXPLICIT TRANSIENT DYNAMIC ANALYSYS
Scale Invariant Feature Transform (SIFT)
A Multiscale Approach to Mesh-based Surface Tension Flows
CSE 554 Lecture 9: Laplacian Deformation
The Finite Element Method
A Volumetric Method for Building Complex Models from Range Images
Comparison of CFEM and DG methods
Lecture 7 Patch based methods: nonlocal means, BM3D, K- SVD, data-driven (tight) frame.
Presentation transcript:

Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow

What are we doing? Fairness: low variation in curvature. Move vertices to achieve. –Mesh topology stays the same.

Overview How do we move vertices? –Explicit integration –Implicit integration What direction do we move vertices? –Simple Laplacian –Scale-dependant Laplacian –Curvature

How do we move vertices?

Integration Intuition X’ = - a· X ( a > 0) Exact solution: e - a· t –Give or take a scale factor.

Explicit Integration X(t+dt) = (1- a ·dt)·X(t) – 1 > a ·dt > 0 OK. – 2 > a ·dt > 1 Damped oscillation. – a ·dt > 2 BOOM! Take small steps to stay stable.

Implicit Integration X(t+dt) = X(t)- a ·dt·X(t+dt) X(t+dt)·(1+ a ·dt) = X(t) X(t+dt) = X(t)·(1+ a ·dt) -1 Higher computational cost. Better stability. –Huge time steps are possible. –… but accuracy will suffer.

Generic Smoothing Eq. Explicit –X(t+dt) = ( I + lam ·dt·M)·X(t) Implicit –X(t+dt)·( I - lam ·dt·M) = X(t) Inverting matrices sucks. (So don’t do it…) Sparsity works for us.

When is Implicit Faster? Small edges require small steps for explicit integration. Sparsity allows faster implicit integration. Accuracy seems to be OK for big time steps. Can only take big steps with implicit…

Where do we move vertices?

Simple Laplacian Move a vertex towards a weighted sum of its neighbors. –Equal weighting. Assumption: it’s a regular mesh. –Mangles the mesh if it’s not. Shrinkage. Sliding.

Scale-dependant Laplacian Move a vertex towards a weighted sum of its neighbors. –Weighted by inverse edge length. Less shape distortion. Less sliding. A little more computation is required.

Curvature Move a vertex along the surface normal, based on the magnitude of the curvature. A.k.a. Move a vertex towards a weighted sum of its neighbors. –But with a funky weight… –Not normalized, either. Sliding should be negligible.

Laplacian & Signal Processing Raising L to a higher power... –Steeper roll off. (Higher order filter.) –Denser matrix. (Less sparse.) –L 2 is a good balance. Combinations of L and L 2 allow resonant filters, etc.

Summary of Operators Simple Laplacian –Mangles irregular meshes. Scale-dependant Laplacian –Better results. –Still slides. Curvature –Best shape preservation. –Minimal sliding. –Ugly weights.

That Shrinking Thing… Calculating mesh volume is easy. Rescale the mesh to preserve the volume. Amplifies low frequencies. –Only if the mesh shrinks.

Summary Classic ideas, new applications. –Implicit integration. –Lowpass filtering as smoothing. –Scaling a mesh. Better operators for smoothing. –Scale-dependant Laplacian. –Mean curvature.

Where to go from here? Anisotropic smoothing. Statistical techniques. –One step smoothing. –Bilateral mesh denoising.

Fair well.