All-Hex Meshing using Singularity-Restricted Field Yufei Li 1, Yang Liu 2, Weiwei Xu 2, Wenping Wang 1, Baining Guo 2 1. The University of Hong Kong 2.

Slides:



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

Feature-Aligned T-Meshes
Parameterizing a Geometry using the COMSOL Moving Mesh Feature
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Consistent Mesh Parameterizations Peter Schröder Caltech Wim Sweldens Bell Labs Emil Praun Princeton.
Computational Modeling Sciences jfs Hexahedral Sheet Insertion Jason Shepherd October 2008.
SGP 2008 A Local/Global Approach to Mesh Parameterization Ligang Liu Lei Zhang Yin Xu Zhejiang University, China Craig Gotsman Technion, Israel Steven.
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
Discrete Geometry Tutorial 2 1
3D Surface Parameterization Olga Sorkine, May 2005.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
Consistent Spherical Parameterization Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)
VIRTUAL ARTHROSCOPIC KNEE SURGERY TRANING SYSTEM Yang Xiaosong The Chinese University of Hong Kong Tsinghua University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Lapped Textures Emil Praun and Adam Finkelstien (Princeton University) Huges Hoppe (Microsoft Research) SIGGRAPH 2000 Presented by Anteneh.
CAD Import, Partitioning & Meshing J.Cugnoni LMAF / EPFL 2009.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Spherical Parameterization and Remeshing Emil Praun, University of Utah Hugues Hoppe, Microsoft Research.
Isoparametric Elements
Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis Kun Zhou, John Snyder*, Baining Guo, Heung-Yeung Shum Microsoft Research Asia.
Bounded-distortion Piecewise Mesh Parameterization
CS CS 175 – Week 7 Parameterization Linear Methods.
CSE351/ IT351 Modeling and Simulation
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
AMD-Vol. 220: Trends in Unstructured Mesh Generation 1997
Non-Euclidean Embedding
Mesh Parameterization: Theory and Practice Non-Planar Domains.
Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
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.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Grid Generation.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Interactive Rendering of Meso-structure Surface Details using Semi-transparent 3D Textures Vision, Modeling, Visualization Erlangen, Germany November 16-18,
Quads and Friends Kenshi Takayama. General Planar Quadrilateral Mesh Design Using Conjugate Direction Field goal: planar quad (PQ) mesh design – application:
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
Scalable and Fully Distributed Localization With Mere Connectivity.
© Fluent Inc. 10/14/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Volume Meshing and the Sizing.
A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
Unstructured Volume Rendering Jian Huang, CS 594, Spring 2002 This set of slides reference slides developed by Prof. Torsten Moeller, SFU, Canada.
Polynomial Preserving Gradient Recovery in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Mathematics and Implementation of Computer Graphics Techniques 2015 Boundary Aligned Smooth 3D Cross-Frame Field Jin Huang, Yiying Tong, Hongyu Wei, Hujun.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Lapped Solid Textrues Filling a Model with Anisotropic Textures
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Adaptive Meshing Control to Improve Petascale Compass Simulations Xiao-Juan Luo and Mark S Shephard Scientific Computation Research Center (SCOREC) Interoperable.
Controlled-Distortion Constrained Global Parametrization
Interactive Graphics Lecture 10: Slide 1 Interactive Computer Graphics Lecture 10 Introduction to Surface Construction.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Random volumes from matrices Based on the work with Masafumi Fukuma and Sotaro Sugishita (Kyoto Univ.) Naoya Umeda (Kyoto Univ.) [arXiv: ][JHEP.
Reverse Engineering of Point Clouds to Obtain Trimmed NURBS Lavanya Sita Tekumalla Advisor: Prof. Elaine Cohen School of Computing University of Utah Masters.
CAD Import Partitioning & Meshing
QUAD MESHING, CROSS FIELDS, AND THE GINZBURG-LANDAU THEORY
Mesh Morph 2.0 Tutorial 7/29/2019.
Presentation transcript:

All-Hex Meshing using Singularity-Restricted Field Yufei Li 1, Yang Liu 2, Weiwei Xu 2, Wenping Wang 1, Baining Guo 2 1. The University of Hong Kong 2. Microsoft Research Asia

Motivation All-hex mesh –A 3D volume tessellated entirely by hexahedron elements. Why alll-hex mesh? –Reduced number of elements. –Improved speed and accuracy of physical simulations [Shimada 2006; Shepherd and Johnson 2008]. All-hex mesh Tetrahedral mesh 1/28

Motivation Issues –Highly constrained connectivity. –Require much user interaction. Industrial practice –Multiple sweeping [Shepherd et al. 2000]; –Paving and plastering [Staten et al. 2005]; –… Semi-automatic User interaction Semi-automatic User interaction ANSYS software 2/28

Motivation Quality criteria for all-hex mesh –Boundary conformity –Feature alignment –Low distortion Goal: automatically generate all-hex meshes with high-quality Feature Alignment Low Distortion All-hex mesh Boundary Conformity 3/28

Existing methods: all-hex meshing based on volume parameterization guided by 3D frame field Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) 3D frame field (inside the volume) 3D frame field (inside the volume) Volume parameterization (guided by 3D frame field) Volume parameterization (guided by 3D frame field) All-hex mesh 4/28

Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) 3D frame field (inside the volume) 3D frame field (inside the volume) Volume parameterization (guided by 3D frame field) Volume parameterization (guided by 3D frame field) All-hex mesh Hex-dominant mesh [Huang et al. 2011] 5/28 Existing methods: all-hex meshing based on volume parameterization guided by 3D frame field

Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) 3D frame field (inside the volume) 3D frame field (inside the volume) Volume parameterization (guided by 3D frame field) Volume parameterization (guided by 3D frame field) All-hex mesh CubeCover [Nieser et al. 2011] Manually designed meta-mesh 6/28 Existing methods: all-hex meshing based on volume parameterization guided by 3D frame field

Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) 3D frame field Volume parameterization (guided by 3D frame field) Volume parameterization (guided by 3D frame field) All-hex mesh Hex-dominant mesh Our approach: all-hex meshing framework based on singularity-restricted field (SRF). SRF (singularity-restricted field) SRF (singularity-restricted field) All-hex mesh 3D frame field SRF Major contribution Automatic SRF conversion Major contribution Automatic SRF conversion Key condition 7/28

Basics of 3D frame field Discrete setting [Nieser et al. 2011] –3D frame: –Discrete 3D frame field for input tet mesh: a constant 3D frame for each tet. 24 permutations. Chiral Cubical Symmetry Group (24 matrices) Chiral Cubical Symmetry Group (24 matrices) 8/28

Basics of 3D frame field FsFs FtFt A pair of arbitrary frames –Difference: a general rotation. –Matching: the permutation that best matches the two frames (24 choices). Matching 9/28

Basics of 3D frame field An interior edge –How the frames rotate around it? Identity matrix: regular edge. Non-identity matrix: singular edge (23 types). Singular graph 10/28 Proposition: Any singular edge does not end inside the volume.

Singularity-restricted field (SRF) Definition of SRF –A 3D frame field is an SRF if all of its edge types fall into the following subset of rotations: –Ru, Rv, Rw represent the 90 degree rotations around u-, v-, w- coordinate axes, respectively. SRF is necessary for inducing a valid all-hex structure SRF (10 edge types) 3D frame field (24 edge types) [Nieser et al. 2011] 11/28

Converting general 3D frame field to singularity-restricted field (SRF) Operations for SRF conversion: –Matching adjustment: tentatively adjust the matching for any triangular face, and check if improper singular edges could be eliminated. –Improper singular edge collapse. SRF (10 edge types ) 3D frame field (24 edge types ) Necessary for all-hex meshing Eliminate the improper singular edges (14 types) 12/28 Geometric operation

Improper singular edge collapse (topological operation) –Collapse improper singular edges without introducing new ones; –Preserve the validity of mesh topology during the collapsing process. Converting general 3D frame field to singularity-restricted field (SRF) Collapse improper singular edge e e t s2s2 s1s1 13/28 Our algorithm could eliminate all the improper singular edges, except two extreme cases that do not happen in practice. (See proof in the paper) Key

Improper singular edges (in red) are collapsed. Matching adjustment could also smooth the singular graph. SRF Conversion Input frame fieldOutput SRF 14/28

SRF (singularity-restricted field) SRF (singularity-restricted field) Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) Volume parameterization (guided by SRF) Volume parameterization (guided by SRF) All-hex mesh A high-quality all-hex meshing framework based on singularity-restricted field (SRF). Input domainParameter domain Gradient field Given SRF Improved CubeCover [Nieser et al. 2011] to solve this mixed-integer problem. Improved CubeCover [Nieser et al. 2011] to solve this mixed-integer problem. Improvement Adaptive rounding Improvement Adaptive rounding 15/28

Obstacle 1: degenerate element Element Degeneration Input domainParameter domain Zero volume Fail to trace iso-lines Missing hex elements! Degenerate elements (in red) Why degenerate? Singular edge combination on triangular face. 16/28 c b a

SRF (singularity-restricted field) SRF (singularity-restricted field) Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) Volume parameterization (guided by SRF) Volume parameterization (guided by SRF) All-hex mesh All degeneration cases for any triangular face. Handling degenerate elements Preprocessing Topological operations All the degenerate elements (in red) are removed 17/28 See the paper

Obstacle 2: flipped element Input domain Parameter domain Flipped Elements Negative volume Erroneous topology of iso-curve network Erroneous topology of iso-curve network Fix the topology Restore a complete all-hex mesh 18/28

Comparison with [Huang et al. 2011] SRF by our methodFrame field by [Huang et al. 2011] Red edges are improper edges. More smooth Free of improper singular edges. 19/28

Optimized SRF with different frame field initializations 20/28 Singular structure All-hex mesh SRF

Comparison with CubeCover [Nieser et al. 2011] J_min [-1,1]: the minimal scaled Jacobian of hexes, bigger is better. Our method: J_min = 0.609CubeCover: J_min = Cube-like elements Cube-like elements Distorted elements 21/28

Comparison with PolyCube [Gregson et al. 2011] Our method: J_min = 0.351PolyCube: J_min = Poor quality due to PolyCube nature 22/28 Distortion Boundary conformity

More results by our method J_min = J_min = J_min = /28 Feature alignment Cube-like elements

SRF (singularity-restricted field) SRF (singularity-restricted field) Input volume (tetrahedral mesh) Input volume (tetrahedral mesh) Volume parameterization (guided by SRF) Volume parameterization (guided by SRF) All-hex mesh A high-quality all-hex meshing framework based on singularity-restricted field (SRF). Effective smoothness of 3D frame fields Effective operations for SRF conversion Improved volume parameterization by handling degenerate& flipped elements Contributions Key ingredient 24/28

Limitations & Future work No theoretical guarantee that SRF always leads to a valid all-hex structure. Open problem: what is the sufficient condition for all-hex structures? SRF Singularity-restricted field All-hex structure Necessary condition “Almost” but NOT sufficient 25/28

Limitations & Future work No theoretical guarantee that SRF always leads to a valid all-hex structure. Singularity mis-alignment: no global control of singularities. Singularity mis-alignment 26/28

Limitations & Future work No theoretical guarantee that SRF always leads to a valid all-hex structure. Singularity mis-alignment: no global control of singularities. CANNOT guarantee a degeneracy-free or flip-free volume parameterization.  Shortcoming shared by CubeCover [Nieser et al. 2011]. 27/28

Acknowledgements Reviewers for constructive comments. Ulrich Reitebuch, Jin Huang for providing comparison data. Funding agencies: The National Basic Research Program of China (2011CB302400), the Research Grant Council of Hong Kong (718209, , and ) 28/28

Backup slides

Boundary-aligned 3D frame field generation Difference of two frames and FsFs FtFt Optimization –Solved by the L-BFGS method [Liu and Nocedal 1989] Smoothness: closeness from to (24 types of permutations)

Frame field initialization Boundary tets –Smooth boundary cross field + surface normals Interior tets –Propagation from boundary tets. –Assigned to be the same as the one of its nearest boundary tet.

Frame field guiding Small features, not enough tets User intention

Robustness of SRF conversion Test on a random frame field –Initialization: principal-dominant cross-field on the boundary + random frames inside. –Without optimization. SRF conversion tets 6825 vertices 775 proper singular edges 61 improper singular edges tets 6766 vertices 753 proper singular edges 0 improper singular edges

SRF-Guided Volume Parametrization Definition –The integer grids in induce a hex tessellation of the input volume. Gradient field Given SRF Computation Integer variables: –Boundary faces –Vertices on the singular graph –Adjacent face gaps

CANNOT guarantee degeneration- free volume parameterization The triangle has three regular edges (does not belong to the degeneration case in our analysis). Vertices a, b and c are on the singular graph. The triangle has three regular edges (does not belong to the degeneration case in our analysis). Vertices a, b and c are on the singular graph. c b a The triangle might still degenerate due to the integer rounding on vertices a, b and c

SRF is not sufficient The topology of the singular graph prohibits the existence of all-hex structures. What is the sufficient condition for all-hex structures? Triangular face

The singular graph consists of two spiral and close curves inside a torus volume. The tets mapped to negative volumes in the parameterization are rendered. Fail to retrieve an all-hex mesh. CANNOT guarantee flip-free volume parameterization!

Statistics