Reconstruction of Water-tight Surfaces through Delaunay Sculpting Jiju Peethambaran and Ramanathan Muthuganapathy Advanced Geometric Computing Lab, Department.

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.
A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.
Games, Movies and Virtual Worlds – An Introduction to Computer Graphics Ayellet Tal Department of Electrical Engineering Technion.
GRAPP, Lisbon, February 2009 University of Ioannina Skeleton-based Rigid Skinning for Character Animation Andreas Vasilakis and Ioannis Fudos Department.
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.
Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe
Medial axis computation of exact curves and surfaces M. Ramanathan Department of Engineering Design, IIT Madras Medial object.
Visibility of noisy point cloud data Ravish Mehra 1,2 Pushkar Tripathi 1,3 Alla Sheffer 4 Niloy Mitra 1,5 1 IIT Delhi 2 UNC Chapel Hill 3 GaTech 4 UBC.
Discrete Geometry Tutorial 2 1
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
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.
Computing Medial Axis and Curve Skeleton from Voronoi Diagrams Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Joint.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
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.
1 Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Iddo Hanniel, Ramanathan Muthuganapathy, Gershon Elber Department of Computer.
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.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Mesh Scissoring with Minima Rule and Part Salience Yunjin Lee,Seungyong Lee, Ariel Shamir,Daniel cohen-Or, Hans-Peter Seidel Computer Aided Geometric Design,
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
CAD/Graphics 2013, Hong Kong Footpoint distance as a measure of distance computation between curves and surfaces Bharath Ram Sundar*, Abhijit Chunduru*,
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Surface Reconstruction Using RBF Reporter : Lincong Fang
On-line Space Sculpturing for 3D Shape Manipulation
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Geometric Modeling using Polygonal Meshes Lecture 1: Introduction Hamid Laga Office: South.
Polygon Modelling. 3D Representation Wire frame NURBS surface Solid Voxel Mesh.
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Reporter: Zhonggui Chen
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
Shape Reconstruction From Planar Cross Sections CAI Hongjie | May 28, 2008.
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
3D Object Representations
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
Detecting Undersampling in Surface Reconstruction Tamal K. Dey and Joachim Giesen Ohio State University.
Hierarchical Error-Driven Approximation of Implicit Surfaces from Polygonal Meshes Takashi Kanai Yutaka Ohtake Kiwamu Kase University of Tokyo RIKEN, VCAD.
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
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.
Delaunay Triangulation on the GPU
Surface Reconstruction using Radial Basis Functions Michael Kunerth, Philipp Omenitsch and Georg Sperl 1 Institute of Computer Graphics and Algorithms.
BOĞAZİÇİ UNIVERSITY – COMPUTER ENGINEERING Mehmet Balman Computer Engineering, Boğaziçi University Parallel Tetrahedral Mesh Refinement.
High Resolution Surface Reconstruction from Overlapping Multiple-Views
With Tamal Dey, Qichao Que, Issam Safa, Lei Wang, Yusu Wang Computer science and Engineering The Ohio State University Xiaoyin Ge.
June 23, Variational tetrahedral meshing of mechanical models for FEA Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’08 Conference, Orlando, Florida.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
SIGGRAPH 2005 신 승 호 신 승 호. Water Drops on Surfaces Huamin Wang Peter J. Mucha Greg Turk Georgia Institute of Technology.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC.
Lecture 9 : Point Set Processing
3D Object Representations
Reconstruction of Water-tight Surfaces through Delaunay Sculpting
Procedural Animation Lecture 3: Types of 3D models
ATCM 6317 Procedural Animation
Iso-Surface extraction from red and green samples on a regular lattice
Presentation transcript:

Reconstruction of Water-tight Surfaces through Delaunay Sculpting Jiju Peethambaran and Ramanathan Muthuganapathy Advanced Geometric Computing Lab, Department of Engineering Design, Indian Institute of Technology, Madras, India Solid and Physical Modeling 2014

Surface Reconstruction Problem Generate surface mesh from surface samples Reconstruction Algorithm Solid and Physical Modeling 2014

Motivation & Scope Require a surface mesh for  Effective rendering of the model  Computational analysis  Parameterization- Morphing, blending etc.. Morphing-Kreavoy et. al 2004 Blending-Kreavoy et. al 2004 Solid and Physical Modeling 2014

Motivation & Scope Applications-  Reverse engineering  Cultural heritage  Rapid prototyping  Urban modeling etc… Digitization-courtesy: / City modeling-Poullis et.al 2011 Solid and Physical Modeling 2014

Related Work-Implicit Surfaces Represent the surface by a function defined over the space Extract the zero-set Examples  Poisson [Kazhdan. 2005]  RBF [Carr et al. 2001]  MPU [Ohtake et al. 2003]  Wavelet [Manson et al. 2008] etc… Solid and Physical Modeling 2014

Related Work-Delaunay/Voronoi Under dense sampling, neighboring points on the surface is also neighbors in the space Examples  Alpha shape [Edelsbrunner and Mucke 1994]  Sculpture by Boissonat [Boissonnat 1984]  Powercrust [Amenta et al. 2000]  Cocone [Dey et.al, 2006]  Constriction by Veltkamp [Veltkampl, 1994] etc… Each has its own strengths and weaknesses!!! Solid and Physical Modeling 2014

Our Contributions Characterization of Divergent concavity for closed, planar curves Shape-hull graph (SHG)-a proximity graph that captures the geometric shape Surface reconstruction technique  Un-oriented point cloud  Fully automatic, simple and single stage  Delaunay Sculpting  Triangulated water-tight surface mesh Solid and Physical Modeling 2014

Divergent Concavity Closed, planar and positively oriented curve Solid and Physical Modeling 2014

Divergent Concavity Closed, planar and counter clock wise oriented curve Inflection points and curvature Concave portion (green colored) IP Concavity Solid and Physical Modeling 2014

Divergent Concavity Closed, planar and counter clock wise oriented curve Inflection points and curvature Concave portion (green colored) BT-bi-tangent, BTP-bi-tangent points IP BT BTP Concavity Solid and Physical Modeling 2014

Divergent Concavity Closed, planar and counter clock wise oriented curve Inflection points and curvature Concave portion (green colored) BT-bi-tangent, BTP-bi-tangent points Pseudo-concavity IP BT BTP Pseudo concavity Solid and Physical Modeling 2014

Divergent Concavity Extremal and non-extremal BTs Solid and Physical Modeling 2014

Divergent Concavity Divergent pseudo-concavity Medial balls Solid and Physical Modeling 2014

Divergent Concavity Medial balls If all the pseudo-concavities are divergent, then it is divergent concave Divergent Non-divergent Solid and Physical Modeling 2014

Divergent Concavity Implications: Point set, S sampled from a divergent concave curve Solid and Physical Modeling 2014

Divergent Concavity Implications: Delaunay triangulation of S Solid and Physical Modeling 2014

Divergent Concavity Implications: Divergent concave portion Solid and Physical Modeling 2014

Divergent Concavity Implications: Triangles in divergent concave region are Solid and Physical Modeling 2014

Divergent Concavity Implications: Triangles in divergent concave region are  Obtuse  Their longest edge faces towards the extremal BT Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Junction points Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Junction points Connectedness P Q Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Point set Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Point set Del(S) Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Point set Del(S) SHG(S) Del(S)-Delaunay triangles in divergent concave regions =SHG(S) Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Point set Del(S) SHG(S)  Triangulation - sub graph of Del(S)  Connected  No junction points  Consists of Delaunay triangles whose circumcenter lies inside the boundary of SHG Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Point set Del(S) SHG(S)SH(S) Solid and Physical Modeling 2014

Shape-hull Graph (SHG) SHG(S) is a connected triangulation, free of junction points and consists of a subset of Delaunay triangles such that the circumcenter of these triangles lie interior to its boundary. Delaunay triangulation SHG Solid and Physical Modeling 2014

Shape-hull Graph (SHG) Lemma---SH(S), where S is densely sampled from a divergent concave curve Ω, represents piece-wise linear approximation of Ω Point set Shape-hull Divergent concave curve Solid and Physical Modeling 2014

Sculpting Algorithm Construct Delaunay tetrahedral mesh Repeatedly eliminate (or sculpt) boundary tetrahedra, T subjected to the following:  circumcenter of T lies outside the intermediate surface  T satisfies tetrahedral removal rules Solid and Physical Modeling 2014

Tetrahedral removal rules- Remove the tetrahedra with one/ two boundary facets if it satisfy the constraints [Boissonnat,1984 ] 1-boundary facet (abc) 2-boundary facets (abc) & (abd) Sculpting Algorithm Solid and Physical Modeling 2014

Sculpting Algorithm Selection criterion- circumcenter of tetrahedra Circumradius/shortest edge length Random removal Circumradius Volume Solid and Physical Modeling 2014

Sculpting Algorithm Solid and Physical Modeling 2014

Results*-Bimba** 74K points, 250K tetrahedra *implemented in CGAL (computational geometry algorithms library) ** Models from or Stanford 3D scanning repository Solid and Physical Modeling 2014

250K points, 500K Delaunay tetrahedra Results-Budha Solid and Physical Modeling 2014

Caesar, 25K points, 84K tetrahedra Foot, 10K points, 20K Delaunay tetrahedra Results Solid and Physical Modeling 2014

Sheep, 159K points, 552K tetrahedra Shark, 10K points, 20K Delaunay tetrahedra Results Solid and Physical Modeling 2014

Results-Down Sampling Solid and Physical Modeling 2014

Results-Down Sampling Solid and Physical Modeling 2014

Results - Sharp Features Powercrust R cocone Screened poisson Our method Solid and Physical Modeling 2014

Conclusions Divergent concavity for 2D curves Shape-hull graph Sculpting Algorithm for closed surface reconstruction Future work- 1. Genus construction 2. Extension to non-divergent concave curves/surfaces Solid and Physical Modeling 2014

References 1. AMENTA, N., CHOI, S., AND KOLLURI, R. K The power crust, unions of balls, and the medial axis transform. Computational Geometry: Theory and Applications 19, 127– BOISSONNAT, J.-D Geometric structures for threedimensional shape representation. ACM Trans. Graph. 3, 4 (Oct.), 266– DEY, T. K., AND GOSWAMI, S Provable surface reconstruction from noisy samples. Comput. Geom. Theory Appl. 35, 1 (Aug.), 124– MANSON, J., PETROVA, G., AND SCHAEFER, S Streaming surface reconstruction using wavelets. Computer Graphics Forum (Proceedings of the Symposium on Geometry Processing) 27, 5, 1411– OHTAKE, Y., BELYAEV, A., ALEXA, M., TURK, G., AND SEIDEL, H.-P Multi-level partition of unity implicits. In ACM SIGGRAPH 2003 Papers, ACM, New York, NY, USA, SIGGRAPH ’03, 463– VELTKAMP, R. C Closed Object Boundaries from Scattered Points. Springer-Verlag New York, Inc., Secaucus, NJ, USA. 7. EDELSBRUNNER, H., AND M¨U CKE, E. P Threedimensional alpha shapes. ACM Trans. Graph. 13, 1 (Jan.), 43– KAZHDAN, M Reconstruction of solid models from oriented point sets. In Proceedings of the Third Eurographics Symposium on Geometry Processing, Eurographics Association, Airela-Ville, Switzerland, Switzerland, SGP ’05. Solid and Physical Modeling 2014

Thank You Questions? Contact Information: Ramanathan Muthuganapathy Jiju Peethambaran Solid and Physical Modeling 2014