Non-Manifold Medial Surface Reconstruction from Volumetric Data 12010/6/16 Takashi Michikawa and Hiromasa Suzuki Research Center for Advanced Science and.

Slides:



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

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.
CSE554Cell ComplexesSlide 1 CSE 554 Lecture 3: Shape Analysis (Part II) Fall 2014.
Surface Reconstruction From Unorganized Point Sets
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Unconstrained Isosurface Extraction on Arbitrary Octrees
3DSkeleton-based Human Modeling with Metaballs 18 April 2008 Donghun Kim Robot Vision Lab.
Discrete Geometry Tutorial 2 1
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Robust Repair of Polygonal Models Tao Ju Rice University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Mesh Simplification Global and Local Methods:
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,
Stockman CSE/MSU Fall 2005 Models and Matching Methods of modeling objects and their environments; Methods of matching models to sensed data for recogniton.
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Voronoi diagrams of “nice” point sets Nina Amenta UC Davis “The World a Jigsaw”
1 Street Generation for City Modeling Xavier Décoret, François Sillion iMAGIS GRAVIR/IMAG - INRIA.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
ECS 289L A Survey of Mesh-Based Multiresolution Representations Ken Joy Center for Image Processing and Integrated Computing Computer Science Department.
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
Statistical analysis of pore space geometry Stefano Favretto Supervisor : Prof. Martin Blunt Petroleum Engineering and Rock Mechanics Research Group Department.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Department of Computer Science and Engineering Practical Algorithm for a Large Class of Domains Tamal K. Dey and Joshua A. Levine The Ohio State University.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Reporter: Zhonggui Chen
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.
Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
3D Object Representations
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
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.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
A New Voronoi-based Reconstruction Algorithm
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
National Energy Research Scientific Computing Center (NERSC) Visualization Highlights Cristina Siegerist NERSC Center Division, LBNL October 4, 2005.
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
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.
Delaunay Triangulation. - Incremental Construction
Lecture 9 : Point Set Processing
Decimating Samples for Mesh Simplification
Decimation Of Triangle Meshes
CS Computer Graphics II
Controlled Topology Simplification (Voxel Based Object Simplification)
Domain-Modeling Techniques
Meshing of 3-D Data Clouds for Object Description
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
A Volumetric Method for Building Complex Models from Range Images
CSE 554 Lecture 3: Shape Analysis (Part II)
Presentation transcript:

Non-Manifold Medial Surface Reconstruction from Volumetric Data 12010/6/16 Takashi Michikawa and Hiromasa Suzuki Research Center for Advanced Science and Technology The University of Tokyo, JAPAN

Thin-plate mechanical parts Made with metal plates by stamping and welding –Found in many kinds of mechanical objects Car bodies, electric parts etc… –In CAD, Represented by open surfaces with boundaries Non-manifold surfaces 2010/6/162 Thin-plate part (photo) Volumetric Data CAD surfaces Car body (photo)

Goal Extracting medial meshes from CT images of thin-plate parts –Applications : Reverse engineering 2010/6/163 Boundary Junction Closed surfaces by Marching Cubes Medial Mesh CT images

Related work 2010/6/164 CT images Volume Polygon Isosurfaces Marching Cubes, Dual Contouring etc. Medial surfaces Amenta2001 Dey2002 Foskey2003, Sud 2005 etc… Sensitive to noisy bumps Medial voxels Prohaska2002, Fujimori2004 etc.. Sensitive to non-manifold Sensitive to non-manifold

Challenge Handling non-manifold junctions Our method –Polygonization using sub-sampled medial voxels 2010/6/165 Medial voxels Sub-sampling of Medial voxels Medial mesh

Example(1) Shock absorber (car body parts) –400x400x640 –10 min. 2010/6/166 Binary volumeMedial meshManifold decomposition

Application : Reverse Engineering Fitting NURBS surfaces to manifold parts 2010/6/167 Manifold decompositionNURBS surfaceControl points

Example(2) : Complex models Side frame of car body (after crashing) –708x965x813 voxels –8 hours –Application to stress analysis of crashed models 2010/6/168 Binary volume Medial mesh

Example (3) : High-valence junctions Our method “absorbs” complex junctions by sub- sampling and makes junction simple. 2010/6/169 Binary volume Medial voxels Intersection of the medial voxels Medial surface By our method Display Non-manifold edges Junctions are spitted into several small junctions

Procedure Outline 1.Binarize 2.Extract medial voxels 3.Sub-sampling of medial voxels 4.Voronoi diagram on medial voxels 5.Dual graph (Delaunay triangulation) 2010/6/1610

Sub-sampling of medial voxels Covering medial voxels by a set of spheres [Ohtake05] –Select one medial voxel v and define sphere S centered at v –Radius is distance to boundraryscaled by α (α=2 for all examples) –Remove medial voxels in the sphere S –Repeat them until all the medial voxels are covered by spheres 2010/6/1611 medial voxels Sub-sampled medial voxels and their support spheres Removed Sampled

Topology-based sub-sampling Problem : Which point is sampled first? –Random sampling makes small cavities. Priority sampling by voxel topology [Malandain97] –ordering voxels by 1.Topology : junction  boundary  surfaces 2.Distance to the boundary surfaces : voxels with larger distance are selected first 2010/6/1612 RandomPriority

Polygonization Computing Voronoi Diagram restricted on medial voxels by using sampled voxels as sites Creating triangles by dual graph of the Voronoi diagram 2010/6/1613

Mesh Cleaning Non-manifold exceptions –In some case, overlapped triangles are made c.f. Degeneration of Delaunay Triangulation Manifold cleaning for manifold points [Ohtake05] –Referring to topological type of voxels 2010/6/1614

Limitation Too thin input volumes –Sub-sampling may be failed because it remove nothing. Speed –Building Voronoi diagram Sharp corner –Lost by sampling order 2010/6/1615

Summary and Future work Polygonization of thin-plate mechanical objects –sub-sampling simplifies non-manifold junction voxels –Handling non-manifold part Future work –Speed up & robustness –Simultaneous polygonization of wires, thin-plate and solids(e.g. [Ju06]). 2010/6/1616

Acknowledgments Grant –Grants-in-Aid for Scientific Research (Japanese Government) Reverse engineering software –Ko-ichi Matsuzaki ( RCAST, The University of Tokyo) Data courtesy –Honda 2010/6/1617

The End 2010/6/1618

Topology of voxels [Malandain97] Counting the number of FG/BG clusters 2010/6/1619