Feature-Based Mesh Editing Qingnan Zhou 1 Tino Weinkauf 1,2 Olga Sorkine 1,3 1 NYU 2 MPII Saarbrücken 3 ETH Zürich.

Slides:



Advertisements
Similar presentations
Dynamic View Selection for Time-Varying Volumes Guangfeng Ji* and Han-Wei Shen The Ohio State University *Now at Vital Images.
Advertisements

Abstraction of Man-Made Shapes Ravish Mehra 1,2, Qingnan Zhou 1, Jeremy Long 4, Alla Sheffer 1, Amy Gooch 4, Niloy J. Mitra 2,3 1 Univ. of British Columbia.
Maxima and Minima of Functions Maxima and minima of functions occur where there is a change from increasing to decreasing, or vice versa.
Is the shape below a function? Explain. Find the domain and range.
Each part of graph is described as: 1)Increasing : function values increase from left to right 2)Decreasing: function values decrease 3)Constant function.
As-Rigid-As-Possible Surface Modeling
An old friend with a new twist!
Analyzing Multivariable Change: Optimization
Sorce: Suggestive Contours for Conveying Shape. (SIGGRAPH 2003) Doug DeCarlo, Adam Finkelstein, Szymon Rusinkiewicz, Anthony Santella. 1 Suggestive Contours.
SGP 2008 A Local/Global Approach to Mesh Parameterization Ligang Liu Lei Zhang Yin Xu Zhejiang University, China Craig Gotsman Technion, Israel Steven.
2D/3D Shape Manipulation, 3D Printing
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Smoothing 3D Meshes using Markov Random Fields
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
Iterative closest point algorithms
Randomized Cuts for 3D Mesh Analysis
FiberMesh: Designing Freeform Surfaces with 3D Curves
Visualizing High-Order Surface Geometry Pushkar Joshi, Carlo Séquin U.C. Berkeley.
Andrew Nealen, TU Berlin, CG 11 Andrew Nealen TU Berlin Takeo Igarashi The University of Tokyo / PRESTO JST Olga Sorkine Marc Alexa TU Berlin Laplacian.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Relative Extrema.
Unit 11 – Derivative Graphs Section 11.1 – First Derivative Graphs First Derivative Slope of the Tangent Line.
Section 4.1 Maxima and Minima a.Satisfies the conditions of the Extreme Value Theorem. Absolute maximum at x = a and absolute minimum at x.
Chapter 5 Graphing and Optimization Section 5 Absolute Maxima and Minima.
Abstraction of Man-Made Shapes Ravish Mehra 1,2, Qingnan Zhou 1, Jeremy Long 4, Alla Sheffer 1, Amy Gooch 4, Niloy J. Mitra 2,3 1 Univ. of British Columbia.
Math – Getting Information from the Graph of a Function 1.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
AP CALCULUS AB Chapter 4: Applications of Derivatives Section 4.1:
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
Modal Shape Analysis beyond Laplacian (CAGP 2012) Klaus Hildebrandt, Christian Schulz, Christoph von Tycowicz, Konrad Polthier (brief) Presenter: ShiHao.Wu.
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,
Increasing / Decreasing Test
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
Section 4.1 Maximum and Minimum Values Applications of Differentiation.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Procrustes Analysis and Its Application in Computer Graphics Speaker: Lei Zhang 2008/10/08.
Luke Bloy1, Ragini Verma2 The Section of Biomedical Image Analysis
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Now days, sampled 3D models become more widespread in many fields and applications. It is often necessary to have a credible 2D model that emphasizes.
MAT 213 Brief Calculus Section 4.2 Relative and Absolute Extreme Points.
Section 3.1 Maximum and Minimum Values Math 1231: Single-Variable Calculus.
Hierarchical Deformation of Locally Rigid Meshes Josiah Manson and Scott Schaefer Texas A&M University.
Applications of Differentiation Calculus Chapter 3.
Performance Surfaces.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
MA Day 34- February 22, 2013 Review for test #2 Chapter 11: Differential Multivariable Calculus.
Determine where a function is increasing or decreasing When determining if a graph is increasing or decreasing we always start from left and use only the.
An Area-Preserving Cortical Flattening Method Yuefeng Lu 1, Moo K. Chung 1,2,3,, Steve Robbins 4, Alan C. Evans 4 1 Department of Statistics, 2 W.M. Keck.
Stationary/Turning Points How do we find them?. What are they?  Turning points are points where a graph is changing direction  Stationary points are.
First derivative: is positive Curve is rising. is negative Curve is falling. is zero Possible local maximum or minimum. Second derivative: is positive.
A Conjecture & a Theorem
Another sufficient condition of local minima/maxima
Maxima and Minima of Functions
Warm Up What do you know about the graph of f(x) = (x – 2)(x – 4)2 ?
Title: Maximum, Minimum & Point of inflection
Tensor Visualization Chap. 7 October 21, 2008 Jie Zhang Copyright ©
Section 4.3 Optimization.
Using Derivatives For Curve Sketching
4.3 – Derivatives and the shapes of curves
Packet #17 Absolute Extrema and the Extreme Value Theorem
Velocity of hygrobots. Velocity of hygrobots. (A) The difference between l and lp corresponds to a distance that a hygrobot advances a period. (B) Velocity.
Performance Surfaces.
Determine whether the statement is sometimes, always, or never true
3-1 Extreme Values of Functions.
 .
Chapter 12 Graphing and Optimization
Extreme values of functions
Chapter 4 Graphing and Optimization
Presentation transcript:

Feature-Based Mesh Editing Qingnan Zhou 1 Tino Weinkauf 1,2 Olga Sorkine 1,3 1 NYU 2 MPII Saarbrücken 3 ETH Zürich

Deformation

Detail Preserving [Sorkine et al. ARAP Surface Modeling, SGP 07]

Detail Preserving Deformation Structure Preserving [Gal et al., iWires, SIGGRAPH 2009]

Deformation Detail Preserving Structure Preserving Feature Preserving Original [Sorkine et al. ARAP Surface Modeling, SGP 07] Our result

Feature-Based Mesh Editing InputFeature ExtractionResult of feature editing

Features What are features? – In words, features are where surface normal changes abruptly. – In pictures:

Features What are features? [Hildebrandt et al., Smooth Feature Lines, SGP05] – In math: local minimum and maximum of principle curvatures in their corresponding directions. Local maximum Cross Section

Features What are features? [Hildebrandt et al., Smooth Feature Lines, SGP05] – In math: local minimum and maximum of principle curvatures in their corresponding directions. – Zeros of e max that satisfy the following (similar constraints apply to e min ) Extremality: Salient constraints:

Features What are features? – In practice: InputValley lines (blue) Zeros of e min Ridge lines (yellow) Zeros of e max

Feature-Preserving Optimization Idea: if curvature values are preserved, so are their local minima and maxima, and so are the features, right?

Feature-Preserving Optimization Idea: if curvature values are preserved, so are their local minima and maxima, and so are the features, right? – Answer: possibly. – Concern 1: what about principle curvature directions? – Concern 2: non-convex energy?

Feature-Preserving Optimization Energy Formulation:

Feature-Preserving Optimization Energy Formulation: Curvature Preservation:

Feature-Preserving Optimization Energy Formulation: Conformality:

Feature-Preserving Optimization Energy Formulation: Positional constraint:

Feature Manipulation Feature-preserving deformation: [Sorkine et al. ARAP Surface Modeling, SGP 07] Our result: original curvature preserved Original

Feature Manipulation Feature-preserving deformation: [Sorkine et al. ARAP Surface Modeling, SGP 07] Our result: original curvature preserved Original

Feature Manipulation Feature smoothing and sharpening: Original FeaturesOur result

Feature Manipulation Feature smoothing and sharpening: OriginalFeatures smoothed Original Features sharpened

Feature Manipulation Feature creation: OriginalOur result

Feature Manipulation Feature creation: OriginalUser drawn features Red: ridge Blue: valley Our result

Summary We have presented a feature-based deformation system. Our experiments give optimistic results. Future work: – Check for conflicting constraints. – Theoretic support of the idea. – Try meshes with less pronounced features.