Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.

Slides:



Advertisements
Similar presentations
Reconstruction from Voxels (GATE-540)
Advertisements

Yingcai Xiao Chapter 6 Fundamental Algorithms. Types of Visualization Transformation Types 1.Data (Attribute Transformation) 2.Topology (Topological Transformation)
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Text Scaffolds for Effective Surface Labeling Gregory Cipriano and Michael Gleicher.
Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe
Extended Gaussian Images
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 13, 2014 IMPLICIT REPRESENTATIONS IMPLICIT FUNCTIONS IMPLICIT SURFACES MARCHING CUBES.
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Robust Repair of Polygonal Models Tao Ju Rice University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Asst. Prof. Yusuf Sahillioğlu
1cs533d-winter-2005 Notes  More optional reading on web for collision detection.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Lecture 2: Numerical Differentiation. Derivative as a gradient
Octree-Based Decimation of Marching Cubes Surface (1996) Raj Shekhar Elias Fayyad Roni Yagel J. Fredrick Cornhill.
2003 by Jim X. Chen: Introduction to Modeling Jim X. Chen George Mason University.
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Adaptively Sampled Distance Fields (ADFs) A General Representation of Shape for Computer Graphics S. Frisken, R. Perry, A. Rockwood, T. Jones Richard Keiser.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
1Notes. 2 Time integration for particles  Back to the ODE problem, either  Accuracy, stability, and ease-of- implementation are main issues  Obviously.
Lamps of Aladdin1 Moving Mesh Adaptation Techniques Todd Phillips Gary Miller Mark Olah.
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”
Computer Graphics Mirror and Shadows
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Volumetric and Blobby Objects Lecture 8 (Modelling)
EUROGRAPHICS 2005 Presenter : Jong-Hyun Kim. Abstract We present a new method for surface extraction from volume data.  Maintains consistent topology.
In the name of God Computer Graphics Modeling1. Today Introduction Modeling Polygon.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
Grid Generation.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Graphics Graphics Korea University cgvr.korea.ac.kr Creating Virtual World I 김 창 헌 Department of Computer Science Korea University
Dynamic Meshing Using Adaptively Sampled Distance Fields
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.
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Reporter: Zhonggui Chen
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
CMSC 635 Volume Rendering. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
Volume Rendering CMSC 491/635. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
Representation of Objects with Sharp Details in Truncated Distance Fields Pavol Novotný Comenius University, Bratislava, Slovakia Miloš Šrámek Austrian.
Computer Graphics 2 Lecture 7: Texture Mapping Benjamin Mora 1 University of Wales Swansea Pr. Min Chen Dr. Benjamin Mora.
A Computationally Efficient Framework for Modeling Soft Body Impact Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
INFORMATIK A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions Yutaka Ohtake Yutaka Ohtake Alexander Belyaev.
A New Voronoi-based Reconstruction Algorithm
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
In the name of God Computer Graphics. Introduction Modeling techniques modeling techniques managements Some renderings.
Volume and Solid Modeling
Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.
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 ©
Solid Modeling Dr. Scott Schaefer.
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
3D Object Representations
Domain-Modeling Techniques
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Three Step Geometric Pipeline
Overview of Modeling 김성남.
Presentation transcript:

Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen Computer Graphics Group, MPI Saarbrucken Proc. Of ACM SIGGRAPH 2001, page 57 66

Abstract A new technique to extract high quality triangle meshes from volume data. The main two contributions are: –Enhanced distance field representation –Extended Marching Cubes (EMC) About Standard Marching Cubes (MC)

Abstract The above figures show reconstructions of the well-known “fandisk” dataset. Standard MC Standard MC + Enhanced distance field Extended MCExtended MC + Enhanced distance field uniform 65×65×65 grid

About Standard Marching Cubes

Introduction The volume data is usually sampled on a regular grid with a given step width. We often observe severe alias artifacts at sharp features on the extracted surfaces. –Reduce these alias effect –Keep the simple algorithmic structure of the standard MC algorithm

Alias artifacts The Marching-Cubes-type algorithm process discrete volume data. The sampling of the implicit surface f(x,y,z)=0 is performed on the basis of a uniform spatial grid.

Parametric surfaces v.s. Implicit surfaces Parametric surfaces –A mapping from R 2 (u,v) to R 3 (x,y,z) –Parametrized by u and v. x=f(u,v) y=g(u,v) z=h(u,v) –Allows easy enumeration of points. Just plug in values for u and v.

Parametric surfaces v.s. Implicit surfaces Implicit surfaces –Defined by f(x,y,z)=0 Advantages –Easy to check whether a point is “inside” and “outside” –Inside: f(x,y,z) < 0 Disadvantages –One cannot easily enumerate points on the surface. x 2 +y 2 +z 2 -R 2 =0

Introduction The central contributions of this paper are: –Enhanced representation of the distance field This allows us to find more accurate surface. Store directed distance in x, y, and z directions. –Extended Marching Cubes algorithm Reduce alias (converge to the original surface’s normals.)

Distance field representation For a given surface, a volume representation consists of a scalar valued function such that Signed distance field function > 0 outside the surface < 0 inside the surface = 0 on the surface

Operation A B U A - B

Distance field representation The standard way to sample f on a uniform spatial grid g i,j,k = [ ih, jh, kh ]. The sampled distances d i,j,k = f ( ih, jh, kh ) can be interpolated on each grid cell. C i,j,k (h) = [ ih, (i+1)h ] × [ jh, (j+1)h ] × [ kh, (k+1)h ]

Distance field representation The major limitation of this technique is that the samples on S * are not necessarily close to S in the vicinity of sharp features. S S*S*

Distance field representation To improve the approximation one could refine the discretization grid h  h’ < h or switch to higher order polynomial interpolants within each cell C i,j,k (h). First case: –output a larger number of triangles. Second case: –local computations are getting more complicated.

Distance field representation Therefore we suggest a third alternative to avoid these difficulties by using the directed distance field. We store at each grid point g i,j,k three directed distances in x, y, and z direction. > 0 outside the surface < 0 inside the surface = 0 on the surface The three directed distances at one grid point always have the same sign. ( inside / outside status )

Distance field representation The intersection point (Interpolation) It is valid if and have opposite signs. g i,j,k g i+,j,k S h

Distance field representation Standard MCStandard MC + Enhanced distance field

Extended marching cubes Marching cubes in general cannot reconstruct very sharp features and result in aliasing artifacts. –Problem : normals don’t converge –Alias errors in surfaces generated by the MC algorithm. –By decreasing the grid size, the effect becomes less and less visible.

Extended marching cubes What we can do –By using point and normal information on both sides of the sharp feature one can find a good estimate for the feature point at the intersection of the tangent elements.

Extended marching cubes D2Y > 0 X Y D1X < 0 D3X > 0 D1Y < 0 Surface Exact intersection point

Extended marching cubes normal tangent element normal tangent element Reconstructed surface

Extended marching cubes This works only if there is at most one sharp feature. Just like the standard MC, the extended algorithm processes each cell C i,j,k (h) separately. If the cell does not contain a sharp feature –by using the standard Marching Cubes table. If a feature is present –We compute one new sample point close to the expected feature. (generate a triangle fan)

Extended marching cubes For each cell we first have to check if a feature is present and if yes, which type of feature.

Extended marching cubes Postprocessing step –Left : the cells/patches that contain a feature are identified. –Center : one new sample is included per cell. –Right : by using edge flipping to reconstruct the feature edges.

Extended marching cubes Extended MCExtended MC + Enhanced distance field

Result –The execution times include only the running times for standard and extended MC, respectively. –The (directed) distance fields and gradients have been generated in a pre-process.

Result - CSG

Result – Fan Disk Standard MC Standard MC + Enhanced distance field Extended MCExtended MC + Enhanced distance field

Result – Max Planck Low pass filter

Result – CAD 129  129  129

Application – Milling simulation

Application – Surface reconstruction –The original dataset consists 200K scattered points

Application - Remeshing Polygonal meshes that are generated at some intermediate stage of an industrial CAD process often have a bad quality. –Convert a CAD model into a volume representation by sampling its distance field on a uniform grid. –Apply the extended Marching Cubes algorithm to this volume gives a remeshed version.

Conclusions and future directions Adaptively refined octrees. –The problem is to fix the gaps (different refinement levels meet) Parallelization –The algorithm processes each cell individually. (like the standard Marching Cubes)