June 29, 2007 1 The difference between two feature models Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’07 Conference, Honolulu, Hawaii Faculty of Electrical.

Slides:



Advertisements
Similar presentations
Parameterizing a Geometry using the COMSOL Moving Mesh Feature
Advertisements

© Fluent Inc. 4/16/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Edge and Face Meshing.
Abstraction Lecture-4. ADT example: London Underground Map.
5/4/2015rew Accuracy increase in FDTD using two sets of staggered grids E. Shcherbakov May 9, 2006.
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
Geometric Morphometrics
Based on paper by C.S. Chong, A. Senthil Kumar, H.P. Lee
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 14.
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
CAD Import, Partitioning & Meshing J.Cugnoni LMAF / EPFL 2009.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
Structure from motion.
Mechanical Engineering Drawing and Graphics (ME 210) Term 041 Course Outline & Introduction.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Design Optimization School of Engineering University of Bradford 1 Formulation of a design improvement problem as a formal mathematical optimization problem.
1 Relational Algebra and Calculus Yanlei Diao UMass Amherst Feb 1, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
Statistical Shape Models Eigenpatches model regions –Assume shape is fixed –What if it isn’t? Faces with expression changes, organs in medical images etc.
COMPUTER-AIDED DESIGN The functionality of SolidWorks Simulation depends on which software Simulation product is used. The functionality of different producs.
SDC PUBLICATIONS © 2012 Chapter 10 Parametric Constraints Fundamentals Learning Objectives:  Display, Add, and Delete Geometric Constraints  Understand.
CATIAv5 : EUCLID3 Data migrationYann BONCOMPAGNI CERN TS-CSE-CAECATIAv5CATIAv5 Euclid3 data migration.
Introduction to virtual engineering László Horváth Budapest Tech John von Neumann Faculty of Informatics Institute of Intelligent Engineering.
University of Maribor 1 CADUI' June FUNDP Namur An Interactive Constraint-Based Graphics System with Partially Constrained Form-Features.
Curve Modeling Bézier Curves
Laplacian Surface Editing
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Foundation Degree IT Project Milestone 3: Implementation, Testing and Evaluation.
Interim progress summary: ITER Imaging X-ray crystal spectrometer design Sam Davis - UKAEA Robin Barnsley - ITER.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Chapter 3 Meshing Methods for 3D Geometries
COMPUTER AIDED DESIGN -(CAD)-3
Computer Integrated Manufacturing CIM
LIVE INTERACTIVE YOUR DESKTOP 1 Start recording—title slide—1 of 3 Introducing the Next Generation Science Standards Originally presented by:
ME5372/7372 Introduction to CAD/CAM Session 2,( August 28, 2008 ) Instructor : Rajeev Dwivedi Department of Mechanical.
© Fluent Inc. 10/14/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Volume Meshing and the Sizing.
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,
Triangular Mesh Decimation
Intro to Network Design
B.Sc. Matej Gomboši Determining differences between two sets of polygons Laboratory for Geometric Modelling and Multimedia Algorithms Faculty of Electrical.
Representing Geometry (CAD) information in dynamic (Modelica) models MSDL August 29 th, 2009 By Chahé Adourian.
1 Relational Algebra and Calculas Chapter 4, Part A.
ICS 321 Fall 2011 The Relational Model of Data (i) Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 8/29/20111Lipyeow.
Computer Science and Engineering Parallelizing Defect Detection and Categorization Using FREERIDE Leonid Glimcher P. 1 ipdps’05 Scaling and Parallelizing.
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
Pleasing in appearance.
1 Outline Previous work on geometric and solid modeling Multiresolution models based on tetrahedral meshes for volume data analysis Current work on non-manifold.
Adaptive Meshing Control to Improve Petascale Compass Simulations Xiao-Juan Luo and Mark S Shephard Scientific Computation Research Center (SCOREC) Interoperable.
ESDI Workshop on Conceptual Schema Languages and Tools
Review on Graphics Basics. Outline Polygon rendering pipeline Affine transformations Projective transformations Lighting and shading From vertices to.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
1 CS 430/585 Computer Graphics I 3D Modeling: Subdivision Surfaces & Solid Modeling Week 9, Lecture 17 David Breen, William Regli and Maxim Peysakhov Geometric.
Level 2 Unit 2 Investigating Engineering Design Engineering Diploma Level 2 Unit 2 Investigating Engineering Design In this unit you will find out how.
Quality Assurance in the Presence of Variability Kim Lauenroth, Andreas Metzger, Klaus Pohl Institute for Computer Science and Business Information Systems.
Geant4 release 5.1 summary Gabriele Cosmo EP/SFT.
Innovation Intelligence ® Section 4 Applications.
Diagram Editor Use Case Analysis Assumption: simple stand-alone, single user application. Three basic kinds of interaction of the user with the diagram.
Outline ● Introduction – What is the problem ● Generate stochastic textures ● Improve realism ● High level approach - Don't just jump into details – Why.
June 23, Variational tetrahedral meshing of mechanical models for FEA Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’08 Conference, Orlando, Florida.
An Approach to Automated Decomposition of Volumetric Mesh Chuhua Xian, Shuming Gao and Tianming Zhang Zhejiang University.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
CAD Import Partitioning & Meshing
An Algorithm for the Consecutive Ones Property Claudio Eccher.
Computer – Aided Design Terminology You must have a generic understanding of commands and techniques which are used in a number of packages (YOU CANNOT.
Simulation: Editing Non-Native Geometry. © 2016 Autodesk Design Academy Editing Non-Native Geometry How to edit CAD models using Autodesk® SimStudio Tools.
Javad Ghaderi, Tianxiong Ji and R. Srikant
Identification of Variation Points Using Dynamic Analysis
Tutorial 1 Learning Topology Optimization Through Examples and Case Studies August 18, 2019.
Presentation transcript:

June 29, The difference between two feature models Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’07 Conference, Honolulu, Hawaii Faculty of Electrical Engineering, Mathematics and Computer Science

CAD’072 Outline Research motivation Feature modelling The feature difference Modelling the feature difference Application: efficient remeshing Conclusion

CAD’073 Research motivation 1 Efficient repeated processing of large models In particular: remeshing for FEA after model modification CAD modelFEA mesh

CAD’074 Research motivation 2 Model modification:

CAD’075 Research motivation 3 Meshes for variants of model: points; 128,521 tets25000 points; 128,751 tets ~1000 tets in feature ~1900 tets in feature

CAD’076 Research motivation 4 1.Common practice: Full mesh generation each time 2.Our goal: Remeshing of previous mesh meshing modify modelremeshing

CAD’077 Feature modelling 1 Current product modelling systems use feature models Products are represented with features: holes, slots, pockets, protrusions, etc. Features have a generic shape that is controlled through parameters

CAD’078 Feature modelling 2 Modification of feature models: Parameter values / constraints Addition and removal of features As a result: change in geometry Our aim: a description of the difference that facilitates efficient remeshing

CAD’079 Adapting a model:Deriving a new mesh: Intuitive solution: Let features carry their geometry (and mesh) with them The feature difference 1 ?

CAD’0710 When feature geometry is preserved:  mesh local to that feature can be copied Complications for change in interaction/attachment:  local changes to feature geometry: The feature difference 2

CAD’0711 The feature difference 3 How to describe the geometric difference? Look from point of view of the features Natural choice: the variation of the model is through the features For each feature the local change in geometry is recorded

CAD’0712 The feature difference 4 Copying parts of the mesh: Parts can only be copied when underlying geometry can be mapped between models Geometry that can be mapped is persistent To find intuitive persistence we look at the feature geometry ( ≠ BRep geometry ) Geometry that cannot be mapped is non-persistent

CAD’0713 Features’ own geometry is persistent, unless reshaped or not present in both models Change in interaction  non-persistent geometry Manifestation of persistent geometry can change The feature difference 5 model 1model 2 Looking from the point of view of a single feature: persistent non-persistent persistence according to the baseblock:

CAD’0714 The feature difference 6 The difference for elements of each feature: persistent (P)non-persistent (N) manifestation identical (P i ) manifestation different (P d ) model 1 (N 1 ) “old” model 2 (N 2 ) “new” [geometry] [manifestation = on bound./in volume] ( P d1 / P d2 )

CAD’0715 The feature difference -2D Example (1) Feature F 1 has a change of interaction with attached feature F 2 For feature F 2 all remains the same Relocating a feature: P i identical P d1 bound. in 1 P d2 bound. in 2 N 1 only in 1 N 2 only in 2

CAD’0716 The feature difference -2D Example (2) Feature F 1 has a change of interaction due to new feature F 3 Feature F 3 is completely new to the model For feature F 2 all remains the same Adding / removing a feature: P i identical P d1 bound. in 1 P d2 bound. in 2 N 1 only in 1 N 2 only in 2

CAD’0717 The feature difference - reshaping How to handle changing feature shape? “Self-interaction” Solution not unique! Align on fixed reference point  consistent, deterministic

CAD’0718 The feature difference -2D Example (3) Feature F 1 has a change in interaction with F 2 Feature F 2 has been scaled and translated For feature F 3 the interaction with F 2 changes Combining translation, reshaping and negative nature: P i identical P d1 bound. in 1 P d2 bound. in 2 N 1 only in 1 N 2 only in 2 Note: F 3 is a hole

CAD’0719 Modelling the feature difference 1 Two main steps: 1.Non-regular union  merge of objects; all original entities are kept For the complete geometry of corresponding features Implementation on top of geometric modelling kernel (ACIS)

CAD’0720 Modelling the feature difference 2 Two main steps: 1.Non-regular union 2.Categorisation of entities  P i, P d, N 1, N 2 Start union: default N 1 /N 2 On merge (V ertex -V ertex, E-E, F-F, C-C): comparison  P i /P d

CAD’0721 Modelling the feature difference 3 The difference model is the set of all individual feature differences Complete explicit construction not necessary: Many features will be 100% persistent New or deleted features are 100% non-persistent  a single attribute is sufficient for those featues Feature correspondence between models essential difference modelinput

CAD’0722 Application: efficient remeshing 1 Assumptions: Model modifications influence geometry only locally Considerable degree of feature correspondence Mesh generation optimisation based  time consuming construction limited, local change

CAD’0723 Application: efficient remeshing 2 Original mesh: Variational tetrahedral meshing (Delaunay connectivity) Sketch of a remeshing approach: 1.Construct difference model 2.Per feature, copy points based on persistent volume 3.Mesh new geometry 4.Mark points on/near non-persistent geometry 5.Optimise marked points

CAD’0724 Conclusions 1 Feature point of view leads to natural/intuitive difference Feature difference applies to feature aspects in general  any attribute local to a feature can be compared Difference model and remeshing handle changes in topology!

CAD’0725 Conclusions 2 Speed-up when remeshing similar models for FEA  intended for quality meshes of large models Easier direct comparison of FEA result  persistent regions with largely identical mesh Open for investigation: Practical investigation of remeshing (work in progress) Dealing with mesh sizing Other meshing algorithms / mesh types

CAD’0726 Credits Research supported by NWO (Netherlands Organisation for Scientific Research)

CAD’0727