Meshing of 3-D Data Clouds for Object Description

Slides:



Advertisements
Similar presentations
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Advertisements

3D shapes.
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Oracle Spatial and Mapviewer Problems From Real World Applications.
3/5/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations II Carola Wenk Based on: Computational.
Discrete Geometry Tutorial 2 1
Boolean Operations on Subdivision Surfaces Yohan FOUGEROLLE MS 2001/2002 Sebti FOUFOU Marc Neveu University of Burgundy.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Spatial Information Systems (SIS)
Non-Manifold Medial Surface Reconstruction from Volumetric Data 12010/6/16 Takashi Michikawa and Hiromasa Suzuki Research Center for Advanced Science and.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
CENG 789 – Digital Geometry Processing 01- Introduction Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
lecture 4 : Isosurface Extraction
Octree-Based Decimation of Marching Cubes Surface (1996) Raj Shekhar Elias Fayyad Roni Yagel J. Fredrick Cornhill.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
1 University of Denver Department of Mathematics Department of Computer Science.
Marching Cubes A High Resolution 3D Surface Construction Algorithm.
00/4/103DVIP-011 Part Three: Descriptions of 3-D Objects and Scenes.
Surface Area and Volume Three-Dimensional Figures and.
 Glasses not required!.  A polyhedron is a 3-dimensional, closed object whose surface is made up of polygons.  Common examples: cubes and pyramids.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
Lecture 4 : Isosurface Extraction (Advanced Topics)
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
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.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
3-d shapes. This is a cube. Eight corners Six faces cube.
Solid Modeling. Solid Modeling - Polyhedron A polyhedron is a connected mesh of simple planar polygons that encloses a finite amount of space. A polyhedron.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
CSE554FairingSlide 1 CSE 554 Lecture 6: Fairing Fall 2015.
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Lee Byung-Gook Dongseo Univ.
Delaunay Triangulation on the GPU
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
1/57 CS148: Introduction to Computer Graphics and Imaging Geometric Modeling CS148 Lecture 6.
Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Three-Dimensional Figures Identify and classify pyramids and prisms by the number of edges, faces, or vertices Identify and classify pyramids and prisms.
GEOMETRY IN CODYS WORLD SHAPES AND LINES. RECTANGLE HAS FOUR RIGHT ANGLES AND ONE BIG FACE.
Lecture 9 : Point Set Processing
CMPS 3130/6130 Computational Geometry Spring 2017
Randomized Incremental Algorithm for Delaunay Triangulation (DT) CS Gates 219 October 19, 3:00 – 4:20 Richard Zhang (for Leo G.) Disclaimer: All.
Model Optimization Wed Nov 16th 2016 Garrett Morrison.
Quarter 1 2D Shapes and Cube.
3D SHAPES.
Constructing Objects in Computer Graphics
What properties can a 3D shape have?
Unit 3 – Lesson 6 Solids.
Constructing Objects in Computer Graphics By Andries van Dam©
Unit 6: Perimeter and Area
Domain-Modeling Techniques
From Point Clouds To Trimmed NURBS
10.1 Solid Geometry Geometry.
A shape description game
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Mesh Parameterization: Theory and Practice
Lecture 09: Data Representation (VII)
Multiresolution Meshes for 3-D Object Description
CSE 554 Lecture 3: Shape Analysis (Part II)
Spatial Databases: Digital Terrain Model
Descriptions of 3-D Objects and Scenes
Three-Dimensional Figures
Perform marching cubes over a sparse dual grid
Spatial Databases: Digital Terrain Model
Presentation transcript:

Meshing of 3-D Data Clouds for Object Description Chapter Eight: Meshing of 3-D Data Clouds for Object Description --- Triangulation of Data Sets 2018/12/2 3DVIP-01

Chapter 9: Triangulation Mesh Objects 2018/12/2 3DVIP-01

Why Need Triangular Meshes? Chapter 9: Triangulation Why Need Triangular Meshes? A simple piecewise linear approximation of 3-D shapes of complex objects Appropriate for processing in graphics hardware Suitable for deformation and manipulation of the object surfaces 2018/12/2 3DVIP-01

Chapter 9: Triangulation Main Topics Planar triangulation Voronoi Diagram Delaunay Triangulation 3-D triangulation based on a physical model --- balloon inflation Marching Cubes 2018/12/2 3DVIP-01

Chapter 9: Triangulation Triangulation of Terrain Data 2018/12/2 3DVIP-01

Chapter 9: Triangulation Planar Triangulation 2018/12/2 3DVIP-01

Chapter 9: Triangulation Voronoi Diagrams 2018/12/2 3DVIP-01

Chapter 9: Triangulation Dual Graph of a Voronoi Diagram 2018/12/2 3DVIP-01

Chapter 9: Triangulation Edge Flipping 2018/12/2 3DVIP-01

Chapter 9: Triangulation Incremental Triangulation Algorithm 2018/12/2 3DVIP-01

Progressive Balloon Inflation Chapter 9: Triangulation Progressive Balloon Inflation Balloon inflation for surface fitting 2018/12/2 3DVIP-01

Chapter 9: Triangulation Physical Model for Balloon Inflation 2018/12/2 3DVIP-01

Chapter 9: Triangulation Subdivision of Triangular Faces 2018/12/2 3DVIP-01

Chapter 9: Triangulation Touching of Balloon at Data 2018/12/2 3DVIP-01

Chapter 9: Triangulation Approximating Errors 2018/12/2 3DVIP-01

Chapter 9: Triangulation Adaptation of Local Fitting 2018/12/2 3DVIP-01

Chapter 9: Triangulation Subdivision for Fitting 2018/12/2 3DVIP-01

Hierarchy of Triangular Meshes Chapter 9: Triangulation Hierarchy of Triangular Meshes Meshes with triangles of different sizes 2018/12/2 3DVIP-01

Contouring Using Marching Squares Chapter 9: Triangulation 2018/12/2 3DVIP-01

Marching Squares Cases Chapter 9: Triangulation 2018/12/2 3DVIP-01

Ambiguity in Connecting Edges Chapter 9: Triangulation 2018/12/2 3DVIP-01

Marching Cubes Chapter 9: Triangulation 2018/12/2 3DVIP-01

Marching Cubes Cases Chapter 9: Triangulation 2018/12/2 3DVIP-01

Marching Cubes Cases Chapter 9: Triangulation 2018/12/2 3DVIP-01

Ambiguity in Connecting Edges Chapter 9: Triangulation 2018/12/2 3DVIP-01

An Example of Extracted Isosurfaces Chapter 9: Triangulation 2018/12/2 3DVIP-01

Marching Cubes for 3-D Data Clouds Chapter 9: Triangulation 2018/12/2 3DVIP-01

An Example of Extracted Meshes Chapter 9: Triangulation 2018/12/2 3DVIP-01