Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.

Slides:



Advertisements
Similar presentations
Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.
Advertisements

1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Surface Simplification using Quadric Error Metrics Guowei Wu.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Surface Reconstruction From Unorganized Point Sets
Junjie Cao 1, Andrea Tagliasacchi 2, Matt Olson 2, Hao Zhang 2, Zhixun Su 1 1 Dalian University of Technology 2 Simon Fraser University Point Cloud Skeletons.
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Discrete Geometry Tutorial 2 1
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
Non-Manifold Medial Surface Reconstruction from Volumetric Data 12010/6/16 Takashi Michikawa and Hiromasa Suzuki Research Center for Advanced Science and.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
5/1/2000Deepak Bandyopadhyay / UNC Chapel Hill 1 Extended Quadric Error Functions for Surface Simplification Deepak Bandyopadhyay COMP 258 F2000 Project.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
New quadric metric for simplifying meshes with appearance attributes Hugues Hoppe Microsoft Research IEEE Visualization 1999 Hugues Hoppe Microsoft Research.
Stefan Gumhold,* Pavel Borodin, # Reinhard Klein # *University of Tuebingen, Germany # University of Bonn, Germany Intersection Free Simplification.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.
T. J. Peters, University of Connecticut K. Abe, J. Bisceglio, A. C. Russell Computational Topology on Approximated Manifolds.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
3D Thinning on Cell Complexes for Computing Curve and Surface Skeletons Lu Liu Advisor: Tao Ju Master Thesis Defense Dec 18 th, 2008.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
11 July 2002 Reverse Engineering 1 Dr. Gábor Renner Geometric Modelling Laboratory, Computer and Automation Research Institute.
Scalable and Fully Distributed Localization With Mere Connectivity.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Surface Simplification Using Quadric Error Metrics Garland & Heckbert Siggraph 97.
Extended Grassfire Transform on Medial Axes of 2D Shapes
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
CSE554SkeletonsSlide 1 CSE 554 Lecture 2: Shape Analysis (Part I) Fall 2015.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
Medial Axis Extraction of 3D Objects Through Radial Basis Functions Ming Ouhyoung, Professor Communication and Multimedia Lab Dept. of CSIE, National Taiwan.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert August 1997 Michael Garland Paul S. Heckbert August 1997.
A New Voronoi-based Reconstruction Algorithm
Using simplified meshes for crude registration of two partially overlapping range images Mercedes R.G.Márquez Wu Shin-Ting State University of Matogrosso.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 9 Ravi Ramamoorthi
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Rendering Large Models (in real time)
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
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.
Delaunay Triangulation. - Incremental Construction
Lecture 9 : Point Set Processing
CSE 554 Lecture 2: Shape Analysis (Part I)
Range Image Segmentation for Modeling and Object Detection in Urban Scenes Cecilia Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter.
CS Computer Graphics II
Recognizing Deformable Shapes
User-Guided Simplification
Domain-Modeling Techniques
Presentation transcript:

Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong

Properties of Medial Axis Transform Medial representation of a shape 1.First proposed by Blum (1967) – the set of centers and radii of inscribed maximal circles 2.Encodes symmetry, thickness and structural components 3.A complete shape representation of both object interior and boundary

“A transformation for extracting new descriptors of shape”, Harry Blum (1967).

Applications Object recognition Shape matching Path planning and collision detection Skeleton-controlled animation Geometric processing Mesh generation Network communication

Voronoi-based Computation of MAT Voronoi-based method (e.g. Amenta and Bern 1998) Every Voronoi vertex is the circum-center of a triangle/tet in Delaunay triangulation.

Instability of MAT Small variations of the object boundary may cause large changes to the medial axis

Instability in Computation of MAT Medial axis of a shape with noisy boundary typically has numerous unstable branches ( spikes ), making it highly non-manifold Smooth boundaryNoisy boundary

Structural Redundancy Causes for spikes in 3D: (1 ) Boundary noise ; and (2) Slivers in Delaunay triangulation of boundary sample points. When four sample points are co-circular, its circumscribing sphere is not unique. # of MA vertices = 54,241

Instability of MAT Small variations of the object boundary may cause large changes to the medial axis

Principle of Approximating MAT

Analogies

Different Methods for Medial Axis Simplification Angle-based filtering (Attali and Montanvert 1996; Amenta et al. 2001; Dey and Zhao 2002; Foskey et al. 2003) Scale-invariant. Does not ensure approximation accuracy The λ -medial axis (Chazal and Lieutier 2005; Chaussard et al. 2009) Incapable of preserving fine feature of the original shape Scale axis transform - SAT (Giesen et al. 2009; Miklos et al. 2010). Removes spikes effectively. May change topology

Different Approaches to Pruning Spikes

3D Medial Axis Simplification Several methods exist for pruning unstable spikes on the medial axis Issues Efficiency : Inefficient representation—MAT represented as the union of a large number of circles/spheres. Accuracy : Inaccurate representation—the simplified medial axis may have large approximation error to the original shape Our goal To efficiently compute a clean, compact and accurate medial axis approximation

Data Redundancy with too many mesh vertices

Compact Representation by Medial Meshes

Medial Meshes -- Approximation of MAT in 3D The medial mesh is 2D simplicial complex approximating the medial axis of a 3D object. Medial vertex: v = ( p, r ) where p is a 3D point, r the medial radius Medial edge: (1 − t ) v 1 + t v 2, t  [0,1]. Medial face: a 1 v 1 + a 2 v 2 + a 3 v 3, where a i ≥ 0 and a 1 + a 2 + a 3 =1.

Medial Meshes

Instability of MAT of 3D Objects Voronoi-based method generates unstable initial medial axis for 3D objects, due to noisy boundary sampling or slivers Noise-free mesh approximating an ellipsoid Medial axis computed by Voronoi-based method

Understanding Unstable Branches Stability Ratio

Two Extreme Cases Stability Ratio = 0 or 1 ratio = 0 ratio = 1

Understanding Unstable Branches Visualization of stability ratio

Simplification by Edge Contraction Based on QEM by Garland and Heckbert (1997) Least squares errors are minimized with quadratic error minimization (QEM). (v 1 and v 2 are merged to v 0 )

QEM for Mesh Decimation in 3D Garland and Heckbert (1997) # v = 6,938 # v = 500 # v = 250

Metric for MAT Simplification

Geometric Interpretations

Quadratic Error for MAT Simplification

Which part to simplify first ? Spikes vs. Dense Smooth Region Mesh decimation Spike pruning

Remove Spikes First The merge cost is defined by

Experiments

Plane (# v = 20 in 2 sec) # v = 100 # v = 20

Dolphin (# v =100 in 12 sec) # v = 54,241 # v = 100

Bear (# v =50 in 7 sec)

Initial MAT from Voronoi Diagram

Compared with Angle Filtering

Compared with lambda -medial axis

Comparison with SAT

Medial Axis of Sphere (Degeneracy Test)

Noise Test

Results

More Results

Further Issues to Address Topology preservation Sharp feature preservation, e.g. for CAD models Converting medial meshes to boundary surfaces MAT for point clouds, noisy and incomplete data MAT used for shape modeling and deformation MAT as shape descriptor for matching and retrieval ….

Thank you! Acknowledgements: Pan Li, Bin Wang, Feng Sun, Xiaohu Guo Caiming Zhang