Fathi El-Yafi Project and Software Development Manager Engineering Simulation
|
|
- Stanley Maxwell
- 6 years ago
- Views:
Transcription
1 An Introduction to Mesh Generation Algorithms Part 2 Fathi El-Yafi Project and Software Development Manager Engineering Simulation April
2 Overview Adaptive Meshing: Remeshing Decimation Optimization April
3 Finite Element Context Objective: Adaptive Meshing 2D Adaptive Mesh according to the specifications sizes imposed by the user Method: Calculating the density of the mesh from a tree Quaternary Nodal generation within each cell of the tree Meshing by advancing front method according to a criterion of Delaunay April
4 Finite Element Context Quaternary Tree In computer science, a B+ tree (also known as a Quaternary Tree) is a type of tree, which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key. It is a dynamic, multilevel index, with maximum and minimum bounds on the number of keys in each index segment (usually called a block' or node'). In a B+ tree, in contrast to a B+ tree, all records are stored at the lowest level of the tree; only keys are stored in interior blocks April
5 Finite Element Context Remeshing a Polygon? n points Possible Remeshing? April
6 Finite Element Context Principle = = = April
7 Finite Element Context Principle n nodes lead to n-2 triangles = It shows that we can create Tn different triangles n(n 1)(n 2) T n = N=10, 1430 possible triangulations! April
8 State of the Art Methods that use the surface parameterization: Appropriate Plane + transport functions Appropriate Plane + Metric: INRIA Discrete Models: Very Refined Initial Mesh + Simplifications Reconstruction: Direct Method: Frontal Triangulation (R. Löhner) Remeshing: HDI (A. Rassineux) April
9 Typical Examples April
10 Objective: Adaptive Meshing using Diffuse Interpolation Building an adaptive mesh of a 3D surface according to size map, using the initial mesh as only data Initial Mesh Local geometric model Adaptive mesh Diffuse Interpolation Hermite type Remeshing Procedure April
11 Remeshing April
12 Some Remeshing Tools Edge splitting Edge collapsing Node removing Edge collapsing and nodal insertion Swapping Nodal Shifting April
13 Remeshing Remeshing according to a size map Simplification of a mesh (70%) April
14 Remeshing Initial Mesh Intermediate Mesh Optimized Mesh April
15 Surface Remeshing Initial Mesh Optimized Mesh April
16 Surface Remeshing Initial model Reduction: 75% Reduction: 60% Adapted to curvature April
17 Surface Meshing Adapted to curvature Simplified model April
18 Simplified Curvature In a plane θ i = 360 α ι Θ 1 Θ 2 Of all the triangles α i 360 ( α θ ) = θ = i i default angle = f (Gaussian Curvature) April
19 Feature Lines Detection April
20 Feature Lines Detection (a) (b) Curvature using Diffuse Interpolation Model Detecting neighborhood Identification of geometrical parameters (radius, axis) April
21 Segmentation into subsets Surface Identification Detection of Feature lines Meshing Principal Curvatures April
22 Segmentation into subsets Example Surface Identification Detection of Feature lines Meshing Instituto Tecnológico de Veracruz Meshing Generation Tutorial April
23 Adaptive Mesh Main Steps Tecnológico de Veracruz Instituto Meshing Generation Tutorial April
24 21-25 April
25 Local model Diffuse Model z = f ( x, y) =< 1, x, y, x, xy, y > α = 2 2 T P α z y MLS Technique : Diffuse approximation Minimisation of an interpolation criterion x J i n T 1 x ( ) = = α w( xi, x) p ( xi x) i i= 1 ( ) α z April
26 Polynomial Base Moving Least Squares 2 2 T < 1,,,,, >=, = x y x xy y p x y p x ( ) T ( ) n = Total number of points «standard» Least Squares i = n i= 1 ( ) ( T ) 2 i α i Jx( α) = p x x f ( x x) Z Select a neighbor V(x) around a point(x,y) i V ( x) ( ) ( T ) 2 i α i Jx( α) = p x x f ( x x) X R The approximation is local April
27 Weighted Moving Least Squares Weight Function i V ( x) T ( ) ( ) ( ) α 2 Jx( α) = w xi x p xi x f ( xi x) xi x w(x i,x) = wref R x ( ) w(x i,x) = ( 1-l i) avec l i = d i/r 2 ( 1+ 2li) April
28 Moving Least Squares Interpolation i V ( x) T ( ) ( ) ( α ) 2 Jx( α) = w xi x p xi x f ( xi x) If w(x,x i ) interpolation at point x i w( x, ) [ ] i x w( x, x) i 1 w( x i, x) April
29 CAD-STL Face Per Face April
30 Finite Element Context STL/Mesh/Adaptive Mesh STL Mesh Mesh Face per Face Adaptive Mesh April
31 STL/Adaptive Mesh Adaptive Mesh STL Mesh April
32 CAD/Adaptive Meshes April
33 Mesh Details April
34 Feature Lines April
35 Surface Remeshing Initial model Simplified model April
36 Surface Remeshing April
37 Surface Remeshing Adaptive Mesh Initial Mesh April
38 Surface Remeshing April
39 Repairing Surface Mesh April
40 Demonstrations April
Overview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis
Overview Efficient Simplification of Pointsampled Surfaces Introduction Local surface analysis Simplification methods Error measurement Comparison PointBased Computer Graphics Mark Pauly PointBased Computer
More informationThe Quality Of 3D Models
The Quality Of 3D Models Problems and Solutions for Applications Post-Design Fathi El-Yafi Senior Product Engineer Product Department of EXA Corporation 1 : Overview Status Problems Identified Defect Sources
More informationOther Voronoi/Delaunay Structures
Other Voronoi/Delaunay Structures Overview Alpha hulls (a subset of Delaunay graph) Extension of Voronoi Diagrams Convex Hull What is it good for? The bounding region of a point set Not so good for describing
More informationApplications. Oversampled 3D scan data. ~150k triangles ~80k triangles
Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient
More information(Discrete) Differential Geometry
(Discrete) Differential Geometry Motivation Understand the structure of the surface Properties: smoothness, curviness, important directions How to modify the surface to change these properties What properties
More informationIntroduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (3) April 27, 2017 Kenshi Takayama Solid modeling 2 Solid models Thin shapes represented by single polygons Unorientable Clear definition of inside & outside
More informationMesh Repairing and Simplification. Gianpaolo Palma
Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a
More informationSurface Mesh Generation
Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented
More informationManipulating the Boundary Mesh
Chapter 7. Manipulating the Boundary Mesh The first step in producing an unstructured grid is to define the shape of the domain boundaries. Using a preprocessor (GAMBIT or a third-party CAD package) you
More informationFinal Project, Digital Geometry Processing
Final Project, Digital Geometry Processing Shayan Hoshyari Student #: 81382153 December 2016 Introduction In this project an adaptive surface remesher has been developed based on the paper [1]. An algorithm
More informationGeometric Modeling in Graphics
Geometric Modeling in Graphics Part 10: Surface reconstruction Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Curve, surface reconstruction Finding compact connected orientable 2-manifold surface
More informationFrom CAD surface models to quality meshes. Patrick LAUG. Projet GAMMA. INRIA Rocquencourt. Outline
From CAD surface models to quality meshes Patrick LAUG Projet GAMMA INRIA Rocquencourt Tetrahedron II Oct. 2007 1 Outline 1. Introduction B-Rep, patches 2. CAD repair ant topology recovery 3. Discretization
More information05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo
05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated
More informationGeometric Modeling in Graphics
Geometric Modeling in Graphics Part 2: Meshes properties Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Meshes properties Working with DCEL representation One connected component with simple
More informationChapter 1 Introduction Motivation Approach Significance of Research Overview of Material... 5
ACKNOWLEDGEMENT First and foremost, I would like to thank my thesis advisor, Dr. A. Lynn Abbott, for his invaluable guidance and patience throughout my entire study at Virginia Tech. Beyond gaining academic
More informationMesh Decimation Using VTK
Mesh Decimation Using VTK Michael Knapp knapp@cg.tuwien.ac.at Institute of Computer Graphics and Algorithms Vienna University of Technology Abstract This paper describes general mesh decimation methods
More informationMesh Decimation. Mark Pauly
Mesh Decimation Mark Pauly Applications Oversampled 3D scan data ~150k triangles ~80k triangles Mark Pauly - ETH Zurich 280 Applications Overtessellation: E.g. iso-surface extraction Mark Pauly - ETH Zurich
More information1 Introduction 2. 2 A Simple Algorithm 2. 3 A Fast Algorithm 2
Polyline Reduction David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy
More informationIsotopic Approximation within a Tolerance Volume
Isotopic Approximation within a Tolerance Volume Manish Mandad David Cohen-Steiner Pierre Alliez Inria Sophia Antipolis - 1 Goals and Motivation - 2 Goals and Motivation Input: Tolerance volume of a surface
More informationParallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece
Parallel Computation of Spherical Parameterizations for Mesh Analysis Th. Athanasiadis and I. Fudos, Greece Introduction Mesh parameterization is a powerful geometry processing tool Applications Remeshing
More informationRecovering Primitives in 3D CAD meshes
Recovering Primitives in 3D CAD / R.Bénière 1/17 Recovering Primitives in 3D CAD meshes Roseline Bénière G. Subsol, G. Gesquière, F. Le Breton and W. Puech LIRMM, Montpellier, France C4W, Montpellier,
More informationSpline Functions on Triangulations
Spline Functions on Triangulations MING-JUN LAI AND LARRY L. SCHUMAKER CAMBRIDGE UNIVERSITY PRESS Contents Preface xi Chapter 1. Bivariate Polynomials 1.1. Introduction 1 1.2. Norms of Polynomials on Triangles
More informationGeometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo
Geometric Modeling Bing-Yu Chen National Taiwan University The University of Tokyo Surface Simplification Motivation Basic Idea of LOD Discrete LOD Continuous LOD Simplification Problem Characteristics
More informationCURVILINEAR MESH GENERATION IN 3D
CURVILINEAR MESH GENERATION IN 3D Saikat Dey, Robert M. O'Bara 2 and Mark S. Shephard 2 SFA Inc. / Naval Research Laboratory, Largo, MD., U.S.A., dey@cosmic.nrl.navy.mil 2 Scientific Computation Research
More informationMesh and Mesh Simplification
Slide Credit: Mirela Ben-Chen Mesh and Mesh Simplification Qixing Huang Mar. 21 st 2018 Mesh DataStructures Data Structures What should bestored? Geometry: 3D coordinates Attributes e.g. normal, color,
More informationGeometry Processing & Geometric Queries. Computer Graphics CMU /15-662
Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,
More informationDigital Geometry Processing
Digital Geometry Processing Spring 2011 physical model acquired point cloud reconstructed model 2 Digital Michelangelo Project Range Scanning Systems Passive: Stereo Matching Find and match features in
More informationCS5620 Intro to Computer Graphics
So Far wireframe hidden surfaces Next step 1 2 Light! Need to understand: How lighting works Types of lights Types of surfaces How shading works Shading algorithms What s Missing? Lighting vs. Shading
More informationVoronoi Diagram. Xiao-Ming Fu
Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines
More informationGeometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies
More informationFathi El-Yafi Project and Software Development Manager Engineering Simulation
An Introduction to Geometry Design Algorithms Fathi El-Yafi Project and Software Development Manager Engineering Simulation 1 Geometry: Overview Geometry Basics Definitions Data Semantic Topology Mathematics
More informationMotivation. Freeform Shape Representations for Efficient Geometry Processing. Operations on Geometric Objects. Functional Representations
Motivation Freeform Shape Representations for Efficient Geometry Processing Eurographics 23 Granada, Spain Geometry Processing (points, wireframes, patches, volumes) Efficient algorithms always have to
More informationMöbius Transformations in Scientific Computing. David Eppstein
Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationInput. Output. Problem Definition. Rectified stereo image pair All correspondences lie in same scan lines
Problem Definition 3 Input Rectified stereo image pair All correspondences lie in same scan lines Output Disparity map of the reference view Foreground: large disparity Background: small disparity Matching
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationPS Computational Geometry Homework Assignment Sheet I (Due 16-March-2018)
Homework Assignment Sheet I (Due 16-March-2018) Assignment 1 Let f, g : N R with f(n) := 8n + 4 and g(n) := 1 5 n log 2 n. Prove explicitly that f O(g) and f o(g). Assignment 2 How can you generalize the
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationAdvanced Meshing Tools
Page 1 Advanced Meshing Tools Preface Using This Guide More Information Conventions What's New? Getting Started Entering the Advanced Meshing Tools Workbench Defining the Surface Mesh Parameters Setting
More informationDigital Geometry Processing. Computer Graphics CMU /15-662
Digital Geometry Processing Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans, not fins
More informationMesh Processing Pipeline
Mesh Smoothing 1 Mesh Processing Pipeline... Scan Reconstruct Clean Remesh 2 Mesh Quality Visual inspection of sensitive attributes Specular shading Flat Shading Gouraud Shading Phong Shading 3 Mesh Quality
More informationA Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes
A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes Mario Botsch, Leif P. Kobbelt Computer Graphics Group, RWTH Aachen, kobbelt,botsch @cs.rwth-aachen.de Abstract When using triangle
More informationThe Computational Geometry Algorithms Library. Andreas Fabri GeometryFactory
The Computational Geometry Algorithms Library Andreas Fabri GeometryFactory Mission Statement Make the large body of geometric algorithms developed in the field of computational geometry available for
More informationOptimal Compression of a Polyline with Segments and Arcs
Optimal Compression of a Polyline with Segments and Arcs Alexander Gribov Esri 380 New York Street Redlands, CA 92373 Email: agribov@esri.com arxiv:1604.07476v5 [cs.cg] 10 Apr 2017 Abstract This paper
More informationVoronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text
Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects
More informationGrafica 3D per i beni culturali: MeshLab features. Lezione 7: 22 Marzo 2013
Grafica 3D per i beni culturali: MeshLab features Lezione 7: 22 Marzo 2013 0 Cleaning Cleaning Cleaning a mesh is an operation which is often necessary before, during and after the processing of a mesh
More informationOverview of Unstructured Mesh Generation Methods
Overview of Unstructured Mesh Generation Methods Structured Meshes local mesh points and cells do not depend on their position but are defined by a general rule. Lead to very efficient algorithms and storage.
More information2.2 Weighting function
Annual Report (23) Kawahara Lab. On Shape Function of Element-Free Galerkin Method for Flow Analysis Daigo NAKAI and Mutsuto KAWAHARA Department of Civil Engineering, Chuo University, Kasuga 3 27, Bunkyo
More informationThe Ball-Pivoting Algorithm for Surface Reconstruction
The Ball-Pivoting Algorithm for Surface Reconstruction 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationParameterization with Manifolds
Parameterization with Manifolds Manifold What they are Why they re difficult to use When a mesh isn t good enough Problem areas besides surface models A simple manifold Sphere, torus, plane, etc. Using
More informationGraph Partitioning for High-Performance Scientific Simulations. Advanced Topics Spring 2008 Prof. Robert van Engelen
Graph Partitioning for High-Performance Scientific Simulations Advanced Topics Spring 2008 Prof. Robert van Engelen Overview Challenges for irregular meshes Modeling mesh-based computations as graphs Static
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationSet No. 1 IV B.Tech. I Semester Regular Examinations, November 2010 FINITE ELEMENT METHODS (Mechanical Engineering) Time: 3 Hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 15 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationBest Practices Workshop: Parts & Mesh-Based Operations
Best Practices Workshop: Parts & Mesh-Based Operations Overview What are Parts and Mesh Based Operations? Transition from Region Based Meshing Why move to Parts Based Meshing How to use Parts Based Mesh
More informationSurface Parameterization
Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping
More informationMesh segmentation. Florent Lafarge Inria Sophia Antipolis - Mediterranee
Mesh segmentation Florent Lafarge Inria Sophia Antipolis - Mediterranee Outline What is mesh segmentation? M = {V,E,F} is a mesh S is either V, E or F (usually F) A Segmentation is a set of sub-meshes
More informationDiscrete Surfaces. David Gu. Tsinghua University. Tsinghua University. 1 Mathematics Science Center
Discrete Surfaces 1 1 Mathematics Science Center Tsinghua University Tsinghua University Discrete Surface Discrete Surfaces Acquired using 3D scanner. Discrete Surfaces Our group has developed high speed
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationCS 523: Computer Graphics, Spring Shape Modeling. Differential Geometry of Surfaces
CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry of Surfaces Andrew Nealen, Rutgers, 2011 2/22/2011 Differential Geometry of Surfaces Continuous and Discrete Motivation Smoothness
More information(LSS Erlangen, Simon Bogner, Ulrich Rüde, Thomas Pohl, Nils Thürey in collaboration with many more
Parallel Free-Surface Extension of the Lattice-Boltzmann Method A Lattice-Boltzmann Approach for Simulation of Two-Phase Flows Stefan Donath (LSS Erlangen, stefan.donath@informatik.uni-erlangen.de) Simon
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationPart I: Theoretical Background and Integration-Based Methods
Large Vector Field Visualization: Theory and Practice Part I: Theoretical Background and Integration-Based Methods Christoph Garth Overview Foundations Time-Varying Vector Fields Numerical Integration
More informationReasoning Boolean Operation for Modeling, Simulation and Fabrication of Heterogeneous Objects. Abstract
Reasoning Boolean Operation for Modeling, Simulation and Fabrication of Heterogeneous Objects X. Hu, T. Jiang, F. Lin, and W. Sun Department of Mechanical Engineering and Mechanics, Drexel University,
More informationThis is an author-deposited version published in: Handle ID:.http://hdl.handle.net/10985/8366
Science Arts & Métiers (SAM) is an open access repository that collects the work of Arts et Métiers ParisTech researchers and makes it freely available over the web where possible. This is an author-deposited
More informationMinimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh
Minimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh Enkhbayar Altantsetseg 1) Katsutsugu Matsuyama ) Kouichi Konno ) 1) National University of Mongolia ) Iwate University {enkhbayar.a}
More informationSurface Reconstruction. Gianpaolo Palma
Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationHermite Curves. Hermite curves. Interpolation versus approximation Hermite curve interpolates the control points Piecewise cubic polynomials
Hermite Curves Hermite curves Interpolation versus approximation Hermite curve interpolates the control points Piecewise cubic polynomials Focus on one segment T1 P0 Q(t) T0 Control points of Bezier curve
More informationv Mesh Generation SMS Tutorials Prerequisites Requirements Time Objectives
v. 12.3 SMS 12.3 Tutorial Mesh Generation Objectives This tutorial demostrates the fundamental tools used to generate a mesh in the SMS. Prerequisites SMS Overview SMS Map Module Requirements Mesh Module
More informationImplicit Surfaces. Misha Kazhdan CS598b
Implicit Surfaces Misha Kazhdan CS598b Definition: Given a function F the implicit surface S generated by this function is the set of zero points of F: S ( ) { p F = } = p The interior I is the set of
More informationSurface Reconstruction with MLS
Surface Reconstruction with MLS Tobias Martin CS7960, Spring 2006, Feb 23 Literature An Adaptive MLS Surface for Reconstruction with Guarantees, T. K. Dey and J. Sun A Sampling Theorem for MLS Surfaces,
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationPersistent Homology and Nested Dissection
Persistent Homology and Nested Dissection Don Sheehy University of Connecticut joint work with Michael Kerber and Primoz Skraba A Topological Data Analysis Pipeline A Topological Data Analysis Pipeline
More informationBroad field that includes low-level operations as well as complex high-level algorithms
Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and
More informationPoint-Based Rendering
Point-Based Rendering Kobbelt & Botsch, Computers & Graphics 2004 Surface Splatting (EWA: Elliptic Weighted Averaging) Main Idea Signal Processing Basics Resampling Gaussian Filters Reconstruction Kernels
More informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationWhat is visualization? Why is it important?
What is visualization? Why is it important? What does visualization do? What is the difference between scientific data and information data Cycle of Visualization Storage De noising/filtering Down sampling
More informationGeometric Features for Non-photorealistiic Rendering
CS348a: Computer Graphics Handout # 6 Geometric Modeling and Processing Stanford University Monday, 27 February 2017 Homework #4: Due Date: Mesh simplification and expressive rendering [95 points] Wednesday,
More informationMoving Least Squares Multiresolution Surface Approximation
Moving Least Squares Multiresolution Surface Approximation BORIS MEDEROS LUIZ VELHO LUIZ HENRIQUE DE FIGUEIREDO IMPA Instituto de Matemática Pura e Aplicada Estrada Dona Castorina 110, 22461-320 Rio de
More informationHalf-edge Collapse Simplification Algorithm Based on Angle Feature
International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2015) Half-edge Collapse Simplification Algorithm Based on Angle Feature 1,2 JunFeng Li, 2 YongBo Chen, 3
More informationThis is an author-deposited version published in: Eprints ID: 4362
This is an author-deposited version published in: http://oatao.univ-toulouse.fr/ Eprints ID: 4362 To cite this document: CHIKHAOUI Oussama, GRESSIER Jérémie, GRONDIN Gilles. Assessment of the Spectral
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationChapter 4 Foundations And Representations ' 4
Chapter 4 Foundations And Representations w
More informationEfficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees
Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Alexander Greß and Reinhard Klein University of Bonn Institute of Computer Science II Römerstraße 164, 53117 Bonn, Germany
More informationTopology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Co
Topology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Convergecast Amitabha Ghosh Yi Wang Ozlem D. Incel V.S. Anil Kumar Bhaskar Krishnamachari Dept. of Electrical Engineering,
More informationGEOMETRY MODELING & GRID GENERATION
GEOMETRY MODELING & GRID GENERATION Dr.D.Prakash Senior Assistant Professor School of Mechanical Engineering SASTRA University, Thanjavur OBJECTIVE The objectives of this discussion are to relate experiences
More informationGeometry Processing TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAA
Geometry Processing What is Geometry Processing? Understanding the math of 3D shape What is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape What is Geometry
More informationFast Computation of Generalized Voronoi Diagrams Using Graphics Hardware
Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware paper by Kennet E. Hoff et al. (University of North Carolina at Chapel Hill) presented by Daniel Emmenegger GDV-Seminar ETH Zürich,
More informationA Voronoi-Based Hybrid Meshing Method
A Voronoi-Based Hybrid Meshing Method Jeanne Pellerin, Lévy Bruno, Guillaume Caumon To cite this version: Jeanne Pellerin, Lévy Bruno, Guillaume Caumon. A Voronoi-Based Hybrid Meshing Method. 2012. hal-00770939
More informationWatertight Planar Surface Reconstruction of Voxel Data
Watertight Planar Surface Reconstruction of Voxel Data Eric Turner CS 284 Final Project Report December 13, 2012 1. Introduction There are many scenarios where a 3D shape is represented by a voxel occupancy
More informationWhat is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape
Geometry Processing What is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape What is Geometry Processing? Understanding the math of 3D shape and applying
More informationPoint-based Simplification Algorithm
Point-based Simplification Algorithm Pai-Feng Lee 1, Bin-Shyan Jong 2 Department of Information Management, Hsing Wu College 1 Dept. of Information and Computer Engineering Engineering, Chung Yuan Christian
More informationCPSC / Texture Mapping
CPSC 599.64 / 601.64 Introduction and Motivation so far: detail through polygons & materials example: brick wall problem: many polygons & materials needed for detailed structures inefficient for memory
More information