Designing Quadrangulations with Discrete Harmonic Forms

Slides:



Advertisements
Similar presentations
Feature-Aligned T-Meshes
Advertisements

Compatible Spatial Discretizations for Partial Differential Equations May 14, 2004 Compatible Reconstruction of Vectors Blair Perot Dept. of Mechanical.
Bicubic G1 interpolation of arbitrary quad meshes using a 4-split
2D/3D Shape Manipulation, 3D Printing
Active Contours, Level Sets, and Image Segmentation
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.
Beams and Frames.
Mean Value Coordinates for Closed Triangular Meshes
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
An Efficient Multigrid Solver for (Evolving) Poisson Systems on Meshes Misha Kazhdan Johns Hopkins University.
Discrete Exterior Calculus. More Complete Introduction See Chapter 7 “Discrete Differential Forms for Computational Modeling” in the SIGGRAPH 2006 Discrete.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
On Triangle/Quad Subdivision Scott Schaefer and Joe Warren TOG 22(1) 28 – 36, 2005 Reporter: Chen zhonggui
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Surfaces Chiew-Lan Tai. Surfaces 2 Reading Required Hills Section Hearn & Baker, sections 8.11, 8.13 Recommended Sections 2.1.4, , 3D Computer.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Bounded-distortion Piecewise Mesh Parameterization
Joel Daniels II University of Utah GDC Group Converting Molecular Meshes into Smooth Interpolatory Spline Solid Models Joel Daniels II Elaine Cohen David.
Mesh Parameterization: Theory and Practice Global Parameterization and Cone Points Matthias Nieser joint with Felix Kälberer and Konrad Polthier Global.
Finite Element Method in Geotechnical Engineering
1 Subdivision Surfaces CAGD Ofir Weber. 2 Spline Surfaces Why use them?  Smooth  Good for modeling - easy to control  Compact (complex objects are.
PA1 Supplementary notes 1 Programming assignment You need to implement the following: 1. Display basic mesh Information Find the number of vertices, edges,
Lecture # 32 (Last) Dr. SOHAIL IQBAL
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
Laplacian Surface Editing
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
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.
1 資訊科學數學 13 : Solutions of Linear Systems 陳光琦助理教授 (Kuang-Chi Chen)
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
SIGGRAPH 2010 “Spectral Mesh Processing” Bruno Lévy and Richard Hao Zhang.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
Mathematics and Implementation of Computer Graphics Techniques 2015 Boundary Aligned Smooth 3D Cross-Frame Field Jin Huang, Yiying Tong, Hongyu Wei, Hujun.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Shape Reconstruction From Planar Cross Sections CAI Hongjie | May 28, 2008.
Parametric Surfaces Define points on the surface in terms of two parameters Simplest case: bilinear interpolation s t s x(s,t)x(s,t) P 0,0 P 1,0 P 1,1.
Mathematics and Implementation of Computer Graphics Techniques 2015 Boundary Aligned Smooth 3D Cross-Frame Field Jin Huang, Yiying Tong, Hongyu Wei, Hujun.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Lapped Solid Textrues Filling a Model with Anisotropic Textures
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Controlled-Distortion Constrained Global Parametrization
Simple Quad Domains for Field Aligned Mesh Parametrization Marco Tarini Enrico Puppo Daniele Panozzo Nico Pietroni Paolo Cignoni Visual Computing Lab ISTI-CNR,
Lee Byung-Gook Dongseo Univ.
Rendering Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico 1 Angel:
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
ECCV Tutorial Mesh Processing Discrete Exterior Calculus
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
Graphics Lecture 14: Slide 1 Interactive Computer Graphics Lecture 14: Radiosity - Computational Issues.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Finite Element Method in Geotechnical Engineering
Boundary Element Analysis of Systems Using Interval Methods
Decimation Of Triangle Meshes
Advanced Computer Graphics
QUAD MESHING, CROSS FIELDS, AND THE GINZBURG-LANDAU THEORY
Mesh Parameterization: Theory and Practice
Presentation transcript:

Designing Quadrangulations with Discrete Harmonic Forms Speaker: Zhang Bo 2007.3.8

References Designing Quadrangulations with Discrete Harmonic Forms Y.Tong P.Alliez D.Cohen-Steiner M.Desbrun Caltech INRIA Sophia-Antipolis, France Eurographics Symposium on Geometry Processing (2006)

About the Author: Yiying Tong 2005-present: Post doctoral Scholar in Computer Science Department, Calteth. 2000-2004: Ph.D. in Computer Science at the Unversity of Southern California (USC). Thesis title: “Towards Applied Geometry in Graphics” Advisor: Professor Mathieu Desbrun. 1997-2000: M.S. in Computer Science at Zhejiang University Thesis Title: “Topics on Image-based Rendering” 1993-1997: B. Engineering in Computer Science at Zhejiang University Eurographics Young Researcher Award 2005 INRIA: 法国国家信息与自动化研究所 CGAL developer Siggraph Significant New Researcher Award 2003

Methods for Quadrangulations Among many: clustering/Morse [Boier-Martin et al 03, Dong et al. 06] global conformal param [Gu/Yau 03] curvature lines [Alliez et al. 03, Marinov/Kobbelt 05] isocontours [Dong et al. 04] two potentials (much) more robust than streamlines periodic global param (PGP) [Ray et al. 06] PGP : nonlinear + no real control This paper: one linear system only This paper: discrete forms & tweaked Laplacian

About Discrete Forms Discrete k-form A real number to every oriented k-simplex 0-forms are discrete versions of continuous scalar fields 1-forms are discrete versions of vector fields

About Exterior Derivative Associates to each k-form ω a particular (k+1)-form dω If ω is a 0-form (valued at each node), i.e., a function on the vertices, then dω evaluated on any oriented edge v1v2 is equal to ω(v1) -ω(v2) Potential: 0-form u is said to be the potential of w if w = du Hodge star: maps a k-form to a complimentary (n-k)-form On 1-forms, it is the discrete analog of applying a rotation of PI/2 to a vector field

About Harmonic Form Codifferential operator: Laplacian: 满足 的微分形式称为调和形式, 特别 的函数 称为调和函数

One Example

Why Harmonic Forms ? Suppose a small surface patch composed of locally “nice” quadrangles Can set a local coordinate system (u, v) du and dv are harmonic, so u and v are also harmonic. because the exterior derivative of a scalar field is harmonic iff this field is harmonic This property explain the popularity of harmonic functions in Euclidean space

Discrete Laplace Operator u = harmonic 0-form

Necessity of discontinuities Harmonic function on closed genus-0 mesh? Only constants! Globally continuous harmonic scalar potentials are too restrictive for quad meshing

Adding singularities Poles, line singularity du dv contouring

With more poles… Crate saddles

Why ? Poincaré–Hopf index theorem! ind(v)=(2-sc(v))/2 ind(f)=(2-sc(f))/2 sc() is the number of sign changes as traverses in order Discrete 1-forms on meshes and applications to 3D mesh parameterization StevenJ.Gortler ,Craig Gotsman ,Dylan Thurston, CAGD 23 (2006) 83–112

Line Singularity -> T-junctions

Singularity graph reverse regular

Singularity lines between “patches” Special continuity of 1-forms du and dv i.e., special continuity of the gradient fields only three different cases in order to guarantee quads

Vertex with no singularities ? Discrete Laplace Equation: wij = cot aij + cot bij Can generate smooth fields even on irregular meshes!

Handling Singularities Vertex with regular continuity as simple as jump in potential: N - N +

Handling Singularities Vertex with reverse continuity

Handling Singularities Vertex with switch continuity

Building a Singularity Graph Meta-mesh consists of Meta-vertices, meta-edges, meta-faces Placing meta-vertices Umbilic points of curvature tensor (for alignment) User-input otherwise Tagging type of meta-edges can be done automatically or manually Geodesic curvature along the boundary will define types of singularities Small linear system to solve for corner’s (Us,Vs) “Gauss elimination”: row echelon matrix

Assisted Singularity Graph Generation Two orthogonal principal curvature directions emin & emax everywhere, except at the so-called umbilics

Final Solve Get a global linear system for the 0-forms u and v of the original mesh as discussion above The system is created by assembling two linear equations per vertex, but none for the vertices on corners of meta-faces This system is sparse and symmetric, Can use the supernodal multifrontal Cholesky factorization option of TAUCS, Efficient!

As a special line in the singularity graph Handle Boundaries As a special line in the singularity graph Force the boundary values to be linearly interpolating the two corner values

Mesh Extraction A contouring of the u and v potentials will stitch automatically into a pure quad mesh

Mesh alignments control provide (soft) control over the final mesh alignments

Mesh size control

Results

Singularity graph

Harmonic Functions u,v

du, dv

Final Remesh

B-Spline Fitting

More result

Summary Extended Laplace operator along singularity lines Only three types: regular, reverse, switch Provide control over singularity: type locations sizing REGULAR REVERSE SWITCH

Summary Sparse and symmetric linear system, average 7 non-zero elements per line, can be compute fast! Not a fully automatic mesher Singularity graph

Thank you!