Laplacian Guided Editing, Synthesis, and Simulation

Summary form only given. The Laplacian has been playing a central role in numerous scientific and engineering problems. It has also become popular in computer graphics. This talk presents a series of our work that exploits the Laplacian in mesh editing, texture synthesis and flow simulation. First, a review is given on mesh editing using differential coordinates and the Poisson equation, which involves the Laplacian. The distinctive feature of this approach is that it modifies the original geometry implicitly through gradient field manipulation. This approach can produce desired results for both global and local editing operations, such as deformation, object merging, and denoising. This technique is computationally involved since it requires solving a large sparse linear system. To overcome this difficulty, an efficient multigrid algorithm specifically tailored for geometry processing has been developed. This multigrid algorithm is capable of interactively processing meshes with hundreds of thousands of vertices. In our latest work, Laplacian-based editing has been generalized to deforming mesh sequences, and efficient user interaction techniques have also been designed. Second, this talk presents a Laplacian-based method for surface texture synthesis and mixing from multiple sources. Eliminating seams among texture patches is important during texture synthesis. In our technique, it is solved by performing Laplacian texture reconstruction, which retains the high frequency details but computes new consistent low frequency components. Third, a method for inviscid flow simulation over manifold surfaces is presented. This method enforces incompressibility on closed surfaces by solving a discrete Poisson equation. Different from previous work, it performs simulations directly on triangle meshes and thus eliminates parametrization distortions.

[1]  Ron Kimmel,et al.  Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Ayellet Tal,et al.  Mesh segmentation using feature point and core extraction , 2005, The Visual Computer.

[3]  Daniel Cohen-Or,et al.  SnapPaste: an interactive technique for easy mesh composition , 2006, The Visual Computer.

[4]  Lihi Zelnik-Manor,et al.  Minimal-cut model composition , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).

[5]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[6]  Szymon Rusinkiewicz,et al.  Modeling by example , 2004, SIGGRAPH 2004.

[7]  Bernard Chazelle,et al.  Strategies for polyhedral surface decomposition: an experimental study , 1995, SCG '95.

[8]  Michael Elad,et al.  Content based retrieval of VRML objects: an iterative and interactive approach , 2002 .

[9]  M. Fatih Demirci,et al.  3D object retrieval using many-to-many matching of curve skeletons , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).

[10]  Nancy M. Amato,et al.  Simultaneous shape decomposition and skeletonization , 2006, SPM '06.

[11]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[12]  Marco Attene,et al.  Mesh Segmentation - A Comparative Study , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[13]  Hans-Peter Seidel,et al.  Mesh scissoring with minima rule and part salience , 2005, Comput. Aided Geom. Des..

[14]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[15]  J. Hughes,et al.  SmoothSketch: 3D free-form shapes from complex sketches , 2006, ACM Trans. Graph..

[16]  Sven J. Dickinson,et al.  Skeleton based shape matching and retrieval , 2003, 2003 Shape Modeling International..