Reporter: Zhonggui Chen

Slides:



Advertisements
Similar presentations
Poisson Surface Reconstruction M Kazhdan, M Bolitho & H Hoppe
Advertisements

Temporally Coherent Completion of Dynamic Shapes Hao Li, Linjie Luo, Daniel Vlasic, Pieter Peers, Jovan Popović, Mark Pauly, Szymon Rusinkiewicz ACM Transactions.
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
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.
Overview Introduction Variational Interpolation
Lapped Textures Emil Praun and Adam Finkelstien (Princeton University) Huges Hoppe (Microsoft Research) SIGGRAPH 2000 Presented by Anteneh.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
CS Peter Schröder Subdivision I: The Basic Ideas.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Mesh Simplification Global and Local Methods:
HCI 530 : Seminar (HCI) Damian Schofield.
Asst. Prof. Yusuf Sahillioğlu
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 8: Intro to 3D objects, meshes Ravi Ramamoorthi
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Example Based 3D Shape Completion Mark Pauly 1,2, Niloy J. Mitra 1, Joachim Giesen 2, Markus Gross 2, Leonidas J. Guibas 1 1 Stanford University 2 ETH,
Filling Holes in Complex Surfaces using Volumetric Diffusion James Davis, Stephen Marschner, Matt Garr, Marc Levoy Stanford University First International.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 4: 3D Objects and Meshes Ravi Ramamoorthi
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL An Incremental Weighted Least Squares Approach To Surface Light Fields Greg Coombe Anselmo Lastra.
Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
 Marc Levoy IBM / IBR “The study of image-based modeling and rendering is the study of sampled representations of geometry.”
Research Goal  We provide physical visualizations to modern structural biologists, thus reviving tactile feedback, in addition to immersive environments.
Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
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
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.
Surface Reconstruction Using RBF Reporter : Lincong Fang
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Wednesday, February 23, 2000 William H. Hsu Department.
Dynamic Meshing Using Adaptively Sampled Distance Fields
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
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.
Graphics Graphics Korea University cgvr.korea.ac.kr Solid Modeling 고려대학교 컴퓨터 그래픽스 연구실.
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Geometry Images Xiang Gu Harvard University Steven J. Gortler Harvard university Hugues Hoppe Microsoft Research Some slides taken from Hugues Hoppe.
A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.
3D Object Representations
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
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
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall D Object Representations Greg Humphreys University of Virginia CS 445, Fall 2003.
Surface Reconstruction using Radial Basis Functions Michael Kunerth, Philipp Omenitsch and Georg Sperl 1 Institute of Computer Graphics and Algorithms.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Volume and Solid Modeling
3D Object Representations 2011, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
CS552: Computer Graphics Lecture 28: Solid Modeling.
ERC Expressive Seminar
3D Object Representations
Domain-Modeling Techniques
Mesh Parameterization: Theory and Practice
A Volumetric Method for Building Complex Models from Range Images
Boolean Operations for Free-form Models Represented in Geometry Images
Overview of Modeling 김성남.
Presentation transcript:

Reporter: Zhonggui Chen 2006.3.29 Surface Completion Reporter: Zhonggui Chen 2006.3.29

Outline Background Overview Geometric method Volumetric method Image-based method Reference

Background Data acquisition

Background Surface reconstruction

Surface Completion Integrated into surface reconstruction algorithm Considered as a post-processing

Requirements Robustness Efficiency Accuracy The method should always produce a watertight surface for any input model. Efficiency The method should be able to process huge models within reasonable time and space. Accuracy The method should preserve the geometry of the input model whenever possible. Boundary condition Context condition

Classifications Geometric method Volumetric method Image-based Operate directly on the polygons in the model Volumetric method Convert a polygonal model into a volume representation Image-based Convert a polygonal model into a geometry image

Radial Basis Functions J.C.Carr et al. Siggraph 2001

Signed-distance Function

Interpolation Problem Given: and Output: ?

Radial Basis Function General form e.g. is a polynomial of low degree the basic function is a real valued function

Evaluation

Evaluation

Greed algorithm Procedure Choose a subset from the interpolation nodes X and fit an RBF only to these. Evaluate the residual, , at all nodes. If then stop. Else append new centers where is large. Re-fit RBF and goto 2.

Results

Summary Repair holes with arbitrary topology Holes are smoothly filled Approximate original surface

Filling Holes in Meshes Peter Liepa. Eurographics Symposium on Geometry Prosessing 2003

Pipeline Hole identification Hole triangulation Mesh refinement Mesh fairing

Triangulation of 3D Polygons Minimum area triangulation Min-max dihedral angel triangulation

Mesh Refinement 1. Subdivision 2. Edge Relaxation

Fairing Weighted umbrella-operator Uniform : Scale-dependent :

Summary Easy to implement Focus algorithm on holes Triangulation may self-intersect Can’t fill holes with islands Fairing weaken original surface feature

Robust Repair of Polygonal Models Tao Ju, Rice University, Siggraph 2004

Pipeline Scan-conversion Sign generation Surface reconstruction

Sign Generation Cell faces containing an odd number of intersection edges

Patch Boundary Circles Patching dual surface Edges intersected with the model and the corresponding dual surface

Marching Cubes Cube with signs at eight corners

Marching Cubes

Results

Results

Summary Employ a space-efficient octree grid Produce closed, manifold surface for any input model 创新点:1. 文章做得很细, 对怎样充分利用八叉树性质提高算法效率有很详细的讨论. 2. 对每个空间点作标记时, 先使对偶曲面封闭, 然后对每个空间点作inside还是outside标记. 3. 利用自己发表的曲面重建的新方法.

Atomic Volumes for Mesh Completion J. Podolak and S. Rusinkiewicz, SGP’05 A volume is atomic if it doesn’t intersect the polygons of the mesh.

Spatial Partitioning

Pipeline Hole Cube Out Cube In Cube

Pipeline

Pipeline Sink (outside) Source (inside)

Pipeline

User Constraints

Results

Summary Avoid changing, approximating or re-sampling the original mesh data Incorporate user constraints Can’t process holes with islands

Geometry Completion and Detail Generation by Texture Synthesis Minh X. Nguyen, Xiaoru Yan, Baoquan Chen. Pacific Graphics 2005

Geometry Image

Basic idea cut Gu et al. Siggraph 02 parametrize

Basic idea cut sample

Basic idea cut store render [r,g,b] = [x,y,z]

References Curless B., Levoy M.: A volumetric method for building complex models from range images. In SIGGRAPH'96 Davis J., Marschner S., Garr M., Levoy M.: Filling holes in complex surfaces using volumetric diffusion, 2002. Fakir S. N., Greg T.: Simplification an repair of polygonal models using volumetic techniques, TVCG. 9, 3(2003) J. C. Carr et al.: Reconstruction and representation of 3D objects with radial basis functions. Siggraph’01. Joshua P., Szymon R., Atomic volumes for mesh completion. Eurographics Symposium on Geometry Processing (2005) Ju T.: Robust repair of polygonal models. ACM Trans. Graph. 23, 3 (2004), 888-895.

References Kolluri R. K.: Spectral watertight surface reconstruction, 2003. Liepa P.: Filling holes in meshes. In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing (2003) Minh X. N., Xiaoru Y., Baoqun C.: Geometry completion and detail generation by texture synthesis. PG’05. Sharf A., Alexa M., Cohen-or D.: Context-based surface completion. ACM Trans. Graph. 23, 3 (2004), 878-887. Verdera, J., Caselles, V., Bertalmio, M., , Sapiro, G.: In-painting surface holes. In: Proceedings of International Conference on Image Processing, pp. 903–906 (2003)

Thank you !