Order-Randomized Laplacian Mesh Smoothing

In this paper we compare three variants of the graph Laplacian smoothing. The first is the standard synchronous implementation, corresponding to multiplication by the graph Laplacian matrix. The second is a voter process inspired asynchronous implementation, assuming that every vertex is equipped with an independent exponential clock. The third is in-between the first two, with the vertices updated according to a random permutation of them. We review some well-known results on spectral graph theory and on voter processes, and we show that while the convergence of the synchronous Laplacian is graph dependent and, generally, does not converge on bipartite graphs, the asynchronous converges with high probability on all graphs. The differences in the properties of these three approaches are illustrated with examples including both regular grids and irregular meshes.

[1]  Masafumi Yamashita,et al.  A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem , 2000, Networks.

[2]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Wei Chen,et al.  Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships , 2011, WSDM.

[4]  Sunil K. Narang,et al.  Bilateral filter: Graph spectral interpretation and extensions , 2013, 2013 IEEE International Conference on Image Processing.

[5]  I. Ivrissimtzis,et al.  A three-dimensional implementation of the boundary element and level set based structural optimisation , 2015 .

[6]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[7]  Ulrich Reif,et al.  Generalized Lane-Riesenfeld algorithms , 2013, Comput. Aided Geom. Des..

[8]  Li Guo,et al.  On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization , 2015, IEEE Transactions on Knowledge and Data Engineering.

[9]  J. T. Cox,et al.  Diffusive Clustering in the Two Dimensional Voter Model , 1986 .

[10]  Malcolm A. Sabin,et al.  Artifacts in recursive subdivision surfaces , 2003 .

[11]  Hans-Peter Seidel,et al.  Interactive multi-resolution modeling on arbitrary meshes , 1998, SIGGRAPH.

[12]  David Peleg,et al.  Distributed Probabilistic Polling and Applications to Proportionate Agreement , 1999, ICALP.

[13]  Heinrich Müller,et al.  Improved Laplacian Smoothing of Noisy Surface Meshes , 1999, Comput. Graph. Forum.

[14]  Christian-A. Bohn,et al.  Growing Surface Structures: A Topology Focused Learning Scheme , 2016 .

[15]  P. Donnelly,et al.  Finite particle systems and infection models , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[17]  Daniel Cohen-Or,et al.  Bilateral mesh denoising , 2003 .

[18]  Roberto Manduchi,et al.  Bilateral filtering for gray and color images , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).