Computational Modeling Sciences jfs Hexahedral Sheet Insertion Jason Shepherd October 2008.

Slides:



Advertisements
Similar presentations
Towards Automating Patient- Specific Finite Element Model Development Kiran H. Shivanna 1,4, Brian D. Adams 2,1, Vincent A. Magnotta 3,1,4, Nicole M. Grosland.
Advertisements

Complexity Metrics for Design & Manufacturability Analysis
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Planar Orientations Chapter 4 ( ) in the book Written By: Tomer Heber.
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Motion Planning for Point Robots CS 659 Kris Hauser.
1 Lecture 7 - Meshing Applied Computational Fluid Dynamics Instructor: André Bakker © André Bakker ( ) © Fluent Inc. (2002)
Extended Gaussian Images
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)
Rüdiger Westermann Lehrstuhl für Computer Graphik und Visualisierung
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Dual Marching Cubes: An Overview
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Jfs Mesh Generation and Parallel Mesh Generation for Biomedical Applications Jason Shepherd Philippe Pebay Michael Stephenson March 2008.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Isoparametric Elements
Isoparametric Elements Structural Mechanics Displacement-based Formulations.
CENG 789 – Digital Geometry Processing 01- Introduction Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Uncalibrated Geometry & Stratification Sastry and Yang
AMD-Vol. 220: Trends in Unstructured Mesh Generation 1997
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Project.
Theodoros Athanasiadis Ioannis Fudos Department of Computer Science
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 6 Start of Part II Material Monday,
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
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.
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
Computational Biomedical Science Batmen Camp Outreach Program Dr. Suzanne Shontz Department of Mathematics and Statistics Department of Computer Science.
Parametric & 3-D Solid Modeling
October 2008 Automation components for simulation-based engineering.
Grid Generation.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Workshop 14 Automatic Hex Meshing of a Bent Bar
7 th Annual Workshop on Charm++ and its Applications ParTopS: Compact Topological Framework for Parallel Fragmentation Simulations Rodrigo Espinha 1 Waldemar.
All that remains is to connect the edges in the variable-setters to the appropriate clause-checkers in the way that we require. This is done by the convey.
On-line Space Sculpturing for 3D Shape Manipulation
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
© Fluent Inc. 10/14/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Volume Meshing and the Sizing.
Progressive Meshes with Controlled Topology Modification University of Bonn Institute II. for Computer Science Computer Graphics Group Pavcl Borodin Rchinhard.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,
An Abstraction and Meshing Technique for Industry Problems Michael Hancock, Debashis Basu, Ashish Das, Nilanjan Mukherjee ( )
An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular, Quadrilateral, and Quad- Dominant Meshes Scott A. Canann, Joseph R.
Computing a Family of Skeletons of Volumetric Models for Shape Description Tao Ju Washington University in St. Louis.
Problem Definition: Solution of PDE’s in Geosciences  Finite elements and finite volume require: u 3D geometrical model u Geological attributes and u.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Stress constrained optimization using X-FEM and Level Set Description
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Implicit Active Shape Models for 3D Segmentation in MR Imaging M. Rousson 1, N. Paragio s 2, R. Deriche 1 1 Odyssée Lab., INRIA Sophia Antipolis, France.
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
An Approach to Automated Decomposition of Volumetric Mesh Chuhua Xian, Shuming Gao and Tianming Zhang Zhejiang University.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
6-1 ANSYS, Inc. Proprietary © 2009 ANSYS, Inc. All rights reserved. April 28, 2009 Inventory # Chapter 6 Sweep Meshing ANSYS Meshing Application.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
Lecture 7 - Meshing Applied Computational Fluid Dynamics
Great Theoretical Ideas In Computer Science
SOLID MODELLING.
Planarity Cox, Sherman, Tong.
Mesh Control using Size Functions and Boundary Layers
Delaunay Triangulation & Application
A Dynamic System Analysis of Simultaneous Recurrent Neural Network
Autonomously designed free-form 2D DNA origami
Presentation transcript:

Computational Modeling Sciences jfs Hexahedral Sheet Insertion Jason Shepherd October 2008

Computational Modeling Sciences jfs Motivation … create an alternate geometric representation consisting of hexahedral elements… Given a geometric representation of an object, G,… Model Creation 25% of DTA time* Decomposition for Hex Meshing 32% of DTA time* Hex Meshing 14% of DTA time* However, decomposition for pave-sweep is more art than science… *timings based on a Design-thru-Analysis study conducted by the DART project Unfortunately, there is only a limited class of geometries for which hexahedral meshing (pave and sweep) can be automated with current tools/algorithms. So…

Computational Modeling Sciences jfs Background Hexahedral meshes are composed of layers of hexahedral elements. –(These layers can also be thought of as manifold surfaces, referred to as sheets.) New layers can be inserted into existing meshes using sheet insertion techniques (i.e., pillowing, dicing, grafting, meshcutting, etc.) The goal, then, is to 1. define minimal sets of layers that must be present to capture the geometric object, 2. constrain the topology and geometry of the layers to satisfy analytic, quality, and topologic constraints for the final hexahedral mesh, and 3. automate the process. + = =+

Computational Modeling Sciences jfs Outline Definitions Framework description Recent efforts Conclusion

Computational Modeling Sciences jfs Fundamental Hexahedral Meshes Definition: A fundamental mesh (M f ) is a hexahedral mesh that contains one sheet for every surface, at least one continuous two-sheet intersection (chord) for every curve, and (vertex valence - 2) triple-point intersections (centroids) for every geometric vertex. Definition: A conforming mesh (M c ) is a hexahedral mesh that conforms to a given geometry. That is, every geometric surface corresponds to a topologically equivalent collection of mesh faces, every curve corresponds to a line of mesh edges, etc. Boundary SheetsFundamental Sheet Fundamental MeshNon-Fundamental Mesh

Computational Modeling Sciences jfs Definitions Sheet conformation affects quality*… …and each hex derives from three sheets. Conformations of each of the sheets affect overall hexahedral quality. (Three planar sheets have highest potential for quality. Feasible regions for optimimum quality are reduced when sheet curvature and orthogonality are reduced.) *See J. F. Shepherd, C. R. Johnson, “Hexahedral Mesh Generation Constraints,” Engineering with Computers, Vol. 24, No. 3, March 2008.

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min *From J. Shepherd “Topologic and Geometric Constraint-Based Hexahedral Mesh Generation,” published Doctoral Dissertation, University of Utah, May 2007.

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min From J. Shepherd “Topologic and Geometric Constraint-Based Hexahedral Mesh Generation,” published Doctoral Dissertation, University of Utah, May 2007.

Computational Modeling Sciences jfs -Mouse model is courtesy of Jeroen Stinstra of the SCI Institute at the University of Utah -Bumpy Sphere model is provided courtesy of mpii by the Shape Repository -Brain and Hand Models are provided courtesy of INRIA by the Shape Repository Mc→MfMc→Mf

Computational Modeling Sciences jfs Mc→Mf Created for S. Shontz's IVC Collaboration with F. Lynch, M.D. (PSU Hershey Medical Center), M. Singer (LLNL), S. Sastry (PSU), and N. Voshell (PSU)

Computational Modeling Sciences jfs -Models A, C, D, E are provided courtesy of ANSYS -Model B is provided courtesy of Tim Tautges by the Shape Repository -Model F is provided courtesy of Inria by the Shape Repository A DB C E B F

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min Mesh Matching Coarsening

Computational Modeling Sciences jfs M c → M* c Mesh Matching - Matt Staten, et al., Poster at the 16 th International Meshing Roundtable. Hexahedral Coarsening – Adam Woodbury, et al., Paper at the 17 th International Meshing Roundtable

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min Proofs for these two transformations available in: F. Ledoux, J. Shepherd, “Topological and Geometrical Properties of Hexahedral Meshes,” to appear in Engineering with Computers. F. Ledoux, J. Shepherd, “Topological Modifications of Hexahedral Meshes via Sheet Operations: A Theoretical Study” to appear in Engineering with Computers.

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min Definition: A hexahedral mesh is minimal (M min ) within a geometric object if: 1. The mesh contains the fewest number of hexahedra for all sets of possible hexahedral meshes for a given object 2. The mesh does not contain any doublets. 3. The mesh does not contain any 'geometric' doublets (i.e. two adjacent faces on a hex cannot belong to a single surface, and two adjacent edges of a hex cannot belong to a single curve.) Conjecture: M f →M min - Appears to hold true, except when thin regions are present in the mesh…

Computational Modeling Sciences jfs M f → M min All Hexahedral Meshes in G All Fundamental Meshes in G Minimal Mesh in G Fundamentality is not a requirement for quality hexahedral meshes, but is useful as a tool for landmarking meshes with respect to geometry. Characterizing a mesh as fundamental is testable. A mesh that is not a fundamental mesh can be converted to fundamental using sheet insertion (and/or other) algorithms. Showing that the minimal mesh is also related to the fundamental mesh can be used to reduce the complexity of an all-hex algorithm (i.e., if I can prove that my algorithm satisfies the fundamental mesh requirements, I can also prove that it will generate a mesh in G).

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min M nc →M c A nc →A c A non-conforming mesh (M nc ) is defined as a ‘topologically equivalent’ and ‘geometrically similar’ mesh to a given geometry, G. (Note: The base quality of M nc and the degree of ‘geometric similarity’ of M nc has a great impact on the final quality of M c.) An assembly mesh (A x ) is simply of collection of geometries meshed contiguously.

Computational Modeling Sciences jfs Technical Framework Mc→MfMc→Mf Mc→M*cMc→M*c M f →M min M nc →M c A nc →A c A non-conforming mesh (M nc ) is defined as a ‘topologically equivalent’ and ‘geometrically similar’ mesh to a given geometry, G. (Note: The base quality of M nc and the degree of ‘geometric similarity’ of M nc has a great impact on the final quality of M c.) An assembly mesh (A x ) is simply of collection of geometries meshed contiguously.

Computational Modeling Sciences jfs M nc → M c Converting a non-conforming mesh to a conforming mesh requires assignment of topologically equivalent collections of mesh entities to appropriate geometric entities –i.e., a topologically equivalent collection of quadrilaterals for each surface, –A line of mesh edges for each curve, –A node for each vertex. Optimally, reducing the distortion caused by the transformation is beneficial, and is largely controlled by the ‘geometric-similarity’ of M nc to G This transformation can be accomplished by embedding the geometric-topology boundary ‘graph’ of G into the mesh-topology boundary ‘graph’ of M nc –(Some embeddings may require mesh-enrichment.)

Computational Modeling Sciences jfs M nc → M c

Computational Modeling Sciences jfs Demos Sbase1 UCP5

Computational Modeling Sciences jfs Examples

Computational Modeling Sciences jfs Needed efforts Algorithmic improvements –Automated guarantees on topology equivalence –Conflict-free network/graph searches –Geometric similarity (how similar is close enough?) –Using smoothing for non-uniform scaling Getting the ‘right’ mesh –Alternative sheet insertions can produce better quality (although the current solution is generally applicable…) Assemblies –Given a topologically-equivalent, geometrically-similar meshed assembly, the transformations work for multiple volumes Geometric tolerance –Selective topology capture is feasible Parallel meshing –Sheet insertions can be localized allowing for potential parallel application.