46
Surface Completion Reporter: Zhonggui Chen 2006.3.29

PPT

Embed Size (px)

Citation preview

Page 1: PPT

Surface Completion

Reporter: Zhonggui Chen2006.3.29

Page 2: PPT

Outline

Background Overview Geometric method Volumetric method Image-based method Reference

Page 3: PPT

Data acquisition

Background

Page 4: PPT

Background Surface reconstruction

Page 5: PPT

Surface Completion

Integrated into surface reconstruction algorithm

Considered as a post-processing

Page 6: PPT

Requirements Robustness

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

Page 7: PPT

Classifications Geometric method

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

Page 8: PPT

Radial Basis Functions

J.C.Carr et al. Siggraph 2001

Page 9: PPT

Signed-distance Function

Page 10: PPT

Interpolation Problem

Given:

and

31{ }Ni iX x

1{ }Ni if

3:s

( ) , 1, , .i is x f i N ??

Output:3{ | ( ) 0}x s x

Page 11: PPT

General form

e.g.

is a polynomial of low degreethe basic function is a real valued function

Radial Basis Function

( )p x

(2) 3BL ( )s

Page 12: PPT

Evaluation

Page 13: PPT

Evaluation

Page 14: PPT

Greed algorithm

Procedure 1. Choose a subset from the interpolation nodes X a

nd fit an RBF only to these.2. Evaluate the residual, , at all nodes.3. If then stop.4. Else append new centers where is large.5. Re-fit RBF and goto 2.

Page 15: PPT

Results

Page 16: PPT

Summary

Repair holes with arbitrary topology

Holes are smoothly filled Approximate original surface

Page 17: PPT

Filling Holes in Meshes

Peter Liepa. Eurographics Symposium on Geometry Prosessing 2

003

Page 18: PPT

Pipeline

1. Hole identification2. Hole triangulation3. Mesh refinement 4. Mesh fairing

Page 19: PPT

Triangulation of 3D Polygons

Minimum area triangulation Min-max dihedral angel

triangulation

Page 20: PPT

Mesh Refinement

2. Edge Relaxation1. Subdivision

Page 21: PPT

Fairing

Weighted umbrella-operator

Uniform : Scale-dependent :

U ( )v v v

Page 22: PPT

Summary

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

feature

Page 23: PPT

Robust Repair of Polygonal Models

Tao Ju, Rice University, Siggraph 2004

Page 24: PPT

Pipeline

I. Scan-conversionII. Sign generationIII. Surface reconstruction

Page 25: PPT

Sign Generation

Cell faces containing an odd number of intersection edges

Page 26: PPT

Patch Boundary Circles

Patching dual surface

Edges intersected with the model and the corresponding dual surface

Page 27: PPT

Marching Cubes

Cube with signs at eight corners

Page 28: PPT

Marching Cubes

Page 29: PPT

Results

Page 30: PPT

Results

Page 31: PPT

Summary

Employ a space-efficient octree grid Produce closed, manifold surface for

any input model

Page 32: PPT

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.

Page 33: PPT

Spatial Partitioning

Page 34: PPT

Pipeline

In Cube

Out Cube

Hole Cube

Page 35: PPT

Pipeline

Page 36: PPT

Pipeline

Sink

(outside)

Source

(inside)

Page 37: PPT

Pipeline

Page 38: PPT

User Constraints

Page 39: PPT

Results

Page 40: PPT

Summary

Avoid changing, approximating or re-sampling the original mesh data

Incorporate user constraints Can’t process holes with islands

Page 41: PPT

Geometry Completion and Detail Generation by Texture Synthesis

Minh X. Nguyen, Xiaoru Yan, Baoquan Chen. Pacific Graphics 200

5

Page 42: PPT

Geometry Image

Page 43: PPT
Page 44: PPT

References Curless B., Levoy M.: A volumetric method for building compl

ex models from range images. In SIGGRAPH'96 Davis J., Marschner S., Garr M., Levoy M.: Filling holes in com

plex surfaces using volumetric diffusion, 2002. Fakir S. N., Greg T.: Simplification an repair of polygonal mod

els using volumetic techniques, TVCG. 9, 3(2003) J. C. Carr et al.: Reconstruction and representation of 3D obj

ects 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.

Page 45: PPT

References Kolluri R. K.: Spectral watertight surface reconstruction, 2003. Liepa P.: Filling holes in meshes. In Proceedings of the Eurogr

aphics/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)

Page 46: PPT

Thank you !