Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.

Slides:



Advertisements
Similar presentations
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Advertisements

COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Yingcai Xiao Chapter 6 Fundamental Algorithms. Types of Visualization Transformation Types 1.Data (Attribute Transformation) 2.Topology (Topological Transformation)
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Lecture Slides Elementary Statistics Eleventh Edition and the Triola.
Extended Gaussian Images
Unconstrained Isosurface Extraction on Arbitrary Octrees
December 14, 2010 Proportionality Through Similarity and Geometry.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
CDS 301 Fall, 2009 Scalar Visualization Chap. 5 September 24, 2009 Jie Zhang Copyright ©
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Mesh Simplification Global and Local Methods:
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Orthogonal Projection and Multiview Representation
2003 by Jim X. Chen: Introduction to Modeling Jim X. Chen George Mason University.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.
Advanced Visualization Techniques
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Adaptive Marching Cubes Renben Shu Chen Zhou Mohan S. Kankanhalli.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
CSE 681 Ray Tracing Implicit Surfaces. CSE 681 Overview Similar to CSG –Combine primitive objects to form complex object Primitives are “density fields”
3-dimensional shape cross section. 3-dimensional space.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
Absolute error. absolute function absolute value.
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
Scalar Visualization Chap. 5 September 23, 2008 Jie Zhang Copyright ©
Shape Recognition and Pose Estimation for Mobile Augmented Reality Author : N. Hagbi, J. El-Sana, O. Bergig, and M. Billinghurst Date : Speaker.
Review of Geometric Shapes
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Dynamic Meshing Using Adaptively Sampled Distance Fields
Computational Biology, Part E Basic Principles of Computer Graphics Robert F. Murphy Copyright  1996, 1999, 2000, All rights reserved.
8 th Grade Math Common Core Standards. The Number System 8.NS Know that there are numbers that are not rational, and approximate them by rational numbers.
Surface Modeling Visualization using BrainVISA Bill Rogers UTHSCSA – Research Imaging Center.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
1 of 66 KS4 Mathematics S6 Transformations. 2 of 66 A A A A A A Contents S6.1 Symmetry S6 Transformations S6.2 Reflection S6.3 Rotation S6.4 Translation.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Slide Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Distance fields. The program Multiple perspectives: euclidean, analytic, transformational Build algebraic skills Foreshadow future math concepts Build.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Per-Pixel Opacity Modulation for Feature Enhancement in Volume Rendering Speaker: 吳昱慧 Date:2010/11/16 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER.
Solid Modeling Dr. Scott Schaefer.
3/21/20161 ELECTRICITY AND MAGNETISM Phy 220 Chapter2: Gauss’s Law.
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
1 E. Angel and D. Shreiner: Interactive Computer Graphics 6E © Addison-Wesley 2012 Marching Squares Ed Angel Professor Emeritus of Computer Science University.
1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC.

Exterior Angle Theorem Parallel Lines Cut by a Transversal
3B Reflections 9-2 in textbook
PLIP BASED UNSHARP MASKING FOR MEDICAL IMAGE ENHANCEMENT
Recognizing Deformable Shapes
Compact Query Term Selection Using Topically Related Text
Domain-Modeling Techniques
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
S4 Coordinates and transformations 1
Presentation transcript:

Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos A. Dietrich, Carlos E. Scheidegger, Joao L. D. Comba, Luciana P. Nedel and Claudio T. Silva Speaker: 吳昱慧 Date:2010/09/28 1

Outline Introduction Related Work Edge Groups – Edge Groups for Cubic Cells Improving Triangle Quality based on Edge Groups – Changing the MC Table – Improving Macet Results Discussion Conclusions 2

Introduction Marching Cubes (MC) Introduce the concept of Edge Groups – MC and other marching methods MC approximates a scalar field inside each cell by a collection of triangles 3

Revisit marching methods to identify the edge groups in each case By evaluating the histograms of triangle quality associated to each edge group of MC 4

Apply a similar analysis to revisit Macet – Improves triangle quality by warping the locations of the MC grid before generating the mesh 5

Related Work Original MC enumerates the 15 cases by inspection of the possible 256 cases, without a formal proof Isosurface extraction methods are usually categorized by the general approach they use in computing the isosurface 6

Edge Groups Edge groups to understand and analyze thetriangle quality generated by MC Each cell generates a set of triangles The quality of each triangle is dictated by the position of its vertices, some of which are shared among adjacent triangles 7

Edge Groups for Cubic Cells Many symmetries of the cubic cell – Different edge configurations can define the same triangle – Same size and right angles between adjacent edges An edge group represents a set of equivalent edge configurations that can be formed 8

9

Any triangle generated by MC can be categorized into one of eight edge groups 10

This means that simply removing edge group 2 from Marching Cubes cases will significantly reduce the probability of generating bad triangles 11

Improving Triangle Quality based on Edge Groups Some observations that motivate our approach include – Each edge group has a different probability to generate bad triangles – All edge groups generate well-shaped triangles – Most edge groups can generate bad triangles Since the proximity of the isosurface to a shared vertex may result in cut points close to each other 12

Changing the MC Table In MC, a triangle is exactly defined – When only three cut points are found inside each cell In Figure 3, show a box plot of the occurrences of edge groups across isosurfaces 13

14

Improving Macet Macet is a technique that improves triangle quality by modifying the inner computation of MC 15

Redefine Macet as a projection proj p (e), which corresponds to the projection of the midpoint of the edge e onto the plane P tangent to the isosurface 16

17

Apply a symmetric non-linear displacement using a modulation function – x axis we describe the original position of the intersection – y axis the normalized position of the displaced cut point 18

Used has parameter value equal to 0.3 which we found experimentally to perform well 19

Results 20

Shows that the edge transformations indeed improve triangle quality 21

22

Discussion Method retains most of the performance advantages and simplicity of Marching Cubes Method is intrinsically based on Marching Cubes, and, as it is, incapable of generating meshes that adapt to the features in the surface 23

24

Conclusions The formulation shares the same combinatorial essence of MC case analysis – Takes a different angle by examining how edges are combined to form triangles Edge groups also serve as a convenient framework to study strategies to improve mesh quality 25