Shape Modeling Vladimir Savchenko

Slides:



Advertisements
Similar presentations
Comparative Visualization for Wave-based and Geometric Acoustics Eduard Deines 1, Martin Bertram 3, Jan Mohring 4, Jevgenij Jegorovs 4, Frank Michel 1,
Advertisements

Cubist inspired Drawing
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Exploration of bump, parallax, relief and displacement mapping
3D Graphics Rendering and Terrain Modeling
Virtual Realism LIGHTING AND SHADING. Lighting & Shading Approximate physical reality Ray tracing: Follow light rays through a scene Accurate, but expensive.
Simplification and improvement of mesh quality using a statistical approach and a bending energy (a)Original “ horse ” model (96966 triangles) and a luminosity.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Mesh Simplification Global and Local Methods:
HCI 530 : Seminar (HCI) Damian Schofield.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 8: Intro to 3D objects, meshes Ravi Ramamoorthi
IMGD 1001: Illumination by Mark Claypool
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 4: 3D Objects and Meshes Ravi Ramamoorthi
Chapter 4 Digital Multimedia, 2nd edition Vector Graphics.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
6.1 Vis_04 Data Visualization Lecture 6 - A Rough Guide to Rendering.
My Research Experience Cheng Qian. Outline 3D Reconstruction Based on Range Images Color Engineering Thermal Image Restoration.
Cornell CS465 Fall 2004 Lecture 1© 2004 Steve Marschner 1 CS465: Computer Graphics I Professor: Steve Marschner.
Projective Texture Atlas for 3D Photography Jonas Sossai Júnior Luiz Velho IMPA.
Animation Vladimir Savchenko
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 10: Computer Graphics Computer Science: An Overview Tenth Edition.
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS 1 Shading (Shading) & Smooth Shading Graphics.
Computer Graphics An Introduction. What’s this course all about? 06/10/2015 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
Sebastian Enrique Columbia University Real-Time Rendering Using CUReT BRDF Materials with Zernike Polynomials CS Topics.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Jonathan M Chye Technical Supervisor : Mr Matthew Bett 2010.
CSC 461: Lecture 3 1 CSC461 Lecture 3: Models and Architectures  Objectives –Learn the basic design of a graphics system –Introduce pipeline architecture.
December 4, 2014Computer Vision Lecture 22: Depth 1 Stereo Vision Comparing the similar triangles PMC l and p l LC l, we get: Similarly, for PNC r and.
INFORMATIK Mesh Smoothing by Adaptive and Anisotropic Gaussian Filter Applied to Mesh Normals Max-Planck-Institut für Informatik Saarbrücken, Germany Yutaka.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
1Computer Graphics Lecture 4 - Models and Architectures John Shearer Culture Lab – space 2
Copyright © Curt Hill Visualization of 3D Worlds How are these images described?
고급 컴퓨터 그래픽스 중앙대학교 컴퓨터공학부 손 봉 수. Course Overview Level : CSE graduate course No required text. We will use lecture notes and on-line materials This course.
3D animation is rendered clip of animated 3D objects in a 3D environment. An example: Examples of movies released in 3D are Toy Story, Cars, Shrek, Wall-E,
Vector Graphics Digital Multimedia Chap 이병희
Design Elements & Principles
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Course Introduction to virtual engineering Óbuda University John von Neumann Faculty of Informatics Institute of Applied Mathematics Lecture and laboratory.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
INFORMATIK A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions Yutaka Ohtake Yutaka Ohtake Alexander Belyaev.
고급 컴퓨터 그래픽스 중앙대학교 컴퓨터공학부 손 봉 수. Course Overview Level : CSE graduate course No required text. We will use lecture notes and on-line materials This course.
Cel shading By jared brock.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
고급 컴퓨터 그래픽스 (Advanced Computer Graphics)
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
CS559: Computer Graphics Final Review Li Zhang Spring 2010.
From: CHAPTER 6– Creating Compound Objects 3DS MAX AND ITS APPLICATIONS Creating Compound Objects James Martin High School Computer Multimedia and Animation.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Render methods. Contents Levels of rendering Wireframe Plain shadow Gouraud Phong Comparison Gouraud-Phong.
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
CSc Computer Graphics Algorithm Lecture 20 Overview of 3D Modeling Techniques Ying Zhu Georgia State University.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
고급 컴퓨터 그래픽스 (Advanced Computer Graphics)
CS Computer Graphics II
Introduction to Graphics Modeling
CSc 8820 Advanced Graphics Algorithms
3D Graphics Rendering PPT By Ricardo Veguilla.
CSC461: Lecture 23 Shading Computation
Domain-Modeling Techniques
POSTPROCESSING Review analysis results and evaluate the performance
Introduction to Computer Graphics with WebGL
The Graphics Pipeline Lecture 5 Mon, Sep 3, 2007.
Mesh Parameterization: Theory and Practice
Noise Robust Surface Reconstruction by Combining PU and Graph-cut
Presentation transcript:

Shape Modeling Vladimir Savchenko

Course Details Course materials can be downloaded from Course materials can be downloaded fromhttp://cis.k.hosei.ac.jp/~vsavchen/SML/ Evaluation: Evaluation: Attendance - 20 Attendance - 20 Projects - 50 Projects - 50 Exam - 30 Exam - 30  Almost all lectures have exercises. Do them!  Some of them will be used during exams!!!

PrefacePreface What is CAGD and CG ? What is CAGD and CG ?  An attempt to abstract from the complexity of phenomena

ExamplesExamples  Global reconstruction from point sets ( Head and Shell reconstruction)

Examples - Surface Retouching (Cont.) Examples - Surface Retouching (Cont.)  Surface retouching of a real polygonal model Left image. A “ Stoned ” model (courtesy of R. Scopigno and M. Calliery of Institute CNUCE). Model size – points. Left image. A “ Stoned ” model (courtesy of R. Scopigno and M. Calliery of Institute CNUCE). Model size – points. Right after surface retouching. Right after surface retouching.

Examples - Surface Retouching (Cont.) Examples - Surface Retouching (Cont.)

Examples- Surface Smoothing with CSRBFs (Cont.) Examples- Surface Smoothing with CSRBFs (Cont.)  Comparison of CSRBF smoothing and Laplacian smoothing. (a) (b) (a) Original noisy sphere “Epcot” model, (770 vertices, 1536 polygons); (b) Smoothed model after 5 iterations based on 11-point interpolation. Processing time: 0.6 s. (a) Original noisy sphere “Epcot” model, (770 vertices, 1536 polygons); (b) Smoothed model after 5 iterations based on 11-point interpolation. Processing time: 0.6 s. 200 iterations, 0.1 s iterations, 0.41 s. 200 iterations, 0.1 s iterations, 0.41 s. Noisy sphere “Epcot” model after processing with Laplacian smoothing Noisy sphere “Epcot” model after processing with Laplacian smoothing

Examples- Surface Smoothing with CSRBFs (Cont.) Examples- Surface Smoothing with CSRBFs (Cont.) (a) The original “Stanford Bunny” model (35947 vertices) (b) Smoothed model after one iteration based on 11 points interpolation (processing time 4.7 sec) (c) Smoothed model after one iteration based on 5 points interpolation (d) Smoothed model after 5 iterations based on 5 points interpolation

Examples- Surface Smoothing with CSRBFs (Cont.) Examples- Surface Smoothing with CSRBFs (Cont.) (a) The original “ ballJoint ” model (Cyberware Inc, vertices) (b) Smoothed model after one iteration based on 11 points interpolation (processing time 4.1 sec)

Examples - Surface Simplification with RBFs (Cont.)  Visual results for the Horse model (a) polygons (b) - 50% (c) - 30% (d) - 10% (e) - 3%

Examples - Surface Simplification with RBFs (Cont.) (a) The modified “ Stanford Bunny ” model, simplified according to the Hoppe algorithm (30% of original data, processing time sec), (a) The modified “ Stanford Bunny ” model, simplified according to the Hoppe algorithm (30% of original data, processing time sec), (b) Simplified model (30%) by using simple geometric error metric (b) Simplified model (30%) by using simple geometric error metric (c) Simplified model according to our approach (30%, processing time sec) (c) Simplified model according to our approach (30%, processing time sec) (a) (b) (c)

Animation with CSRBFs Animation with CSRBFs  The space mapping technique is applied in 3D space and can serve for computing of surface transformations according to the user demands The left image shows the “ Lion-dog ” model (courtesy of Yutaka Ohtake and A Belyev of Max-Planck-Institut f ü r Informatik) (24930 vertices, polygons), whose surface was generated from range data The left image shows the “ Lion-dog ” model (courtesy of Yutaka Ohtake and A Belyev of Max-Planck-Institut f ü r Informatik) (24930 vertices, polygons), whose surface was generated from range data The right image shows plausible deformations after applying space deformations by two 3D points (the time required to calculate deformations is about seconds) The right image shows plausible deformations after applying space deformations by two 3D points (the time required to calculate deformations is about seconds)

Example of global reconstruction. Pattern dependent reconstruction contour maps Existing contour maps are still a rich source of data for the description of terrain surfaces Existing contour maps are still a rich source of data for the description of terrain surfaces Provide reconstruction of scattered data Provide reconstruction of scattered data Main techniques: Main techniques: FEM as a numerical approach to reconstruction of scattered data FEM as a numerical approach to reconstruction of scattered data Fractal-based surface erosion to mimic appearance of natural terrain surfaces Fractal-based surface erosion to mimic appearance of natural terrain surfaces

Example of global reconstruction. Pattern dependent reconstruction contour maps (Cont.) Approximation of fractalized surface (17 contour lines),  = 0.1. Approximation of fractalized surface (17 contour lines),  = 0.1. Approximation of fractalized surface (255 contour lines),  0.1. Approximation of fractalized surface (255 contour lines),  0.1.

Local reconstruction Local reconstruction Implementation of the partition of unity for generation of polygons from scattered data of (the fragment of Mount Bandai): (a) a curvature analysis. Blue area – the surface variation  > 0.3; Implementation of the partition of unity for generation of polygons from scattered data of (the fragment of Mount Bandai): (a) a curvature analysis. Blue area – the surface variation  > 0.3; (b) result of reconstruction (ray tracing). Number of scattered points , number of vertices after reconstruction – 90000, processing time – sec; (b) result of reconstruction (ray tracing). Number of scattered points , number of vertices after reconstruction – 90000, processing time – sec; (c) fragment of the mesh as a wire-frame with color attributes in accordance with calculated heights (c) fragment of the mesh as a wire-frame with color attributes in accordance with calculated heights

Examples of shape triangulations by the use of particles (a) The “Head” model, implicit function constructed by CSRBFs, and a final distribution of particles (a) The “Head” model, implicit function constructed by CSRBFs, and a final distribution of particles (b) Polygonization of “Head” model using final distribution of particles (1487 points) (b) Polygonization of “Head” model using final distribution of particles (1487 points) (a) Incomplete polygonization of the “Seashell” model, obtained by using Bloomenthal’s algorithm (a) Incomplete polygonization of the “Seashell” model, obtained by using Bloomenthal’s algorithm (b) Complete polygonization, obtained by using particle system (b) Complete polygonization, obtained by using particle system

Example – Local reconstruction (cont.)  Surface reconstruction of a technical data set: (a) cloud of points, 4100 scattered points are used (a) cloud of points, 4100 scattered points are used (b) simplified mesh shaded (b) simplified mesh shaded (c) a fragment of the mesh as wire-frame, 7141 vertices (c) a fragment of the mesh as wire-frame, 7141 vertices (a) (b) (c) (a) (b) (c)

Improvement of mesh quality Improvement of mesh quality If a mesh is created for FEM applications, it is very important to control the mesh gradation smoothness. Shape elements have a strong influence on discretization errors If a mesh is created for FEM applications, it is very important to control the mesh gradation smoothness. Shape elements have a strong influence on discretization errors (a) (b) (a) Fragment of an initial mesh ( “ Horse ” model) (b) After improvement

GUI and haptic visualization

GUI and haptic visualization (Cont.) Engraving operations with haptic feedback Engraving operations with haptic feedback The main problem is to provide a system response with the speed sec. The main problem is to provide a system response with the speed sec.  Remarks The virtual environment even with a haptic feedback does not provide a feeling of depth The virtual environment even with a haptic feedback does not provide a feeling of depth Decartes`s dualism (1664) : The intention comes from the soul and is used in combination with the information provided by the senses to determine the proper bodily movement Decartes`s dualism (1664) : The intention comes from the soul and is used in combination with the information provided by the senses to determine the proper bodily movement The second and possibly the greatest problem is that visual appearance or result of applying cutting operations depends on lighting or observer position The second and possibly the greatest problem is that visual appearance or result of applying cutting operations depends on lighting or observer position

GUI and Deformations by the use of CyberGlove GUI and Deformations by the use of CyberGlove