Least-squares meshes

In this paper we introduce least-squares meshes: meshes with a prescribed connectivity that approximate a set of control points in a least-squares sense. The given mesh consists of a planar graph with arbitrary connectivity and a sparse set of control points with geometry. The geometry of the mesh is reconstructed by solving a sparse linear system. The linear system not only defines a surface that approximates the given control points, but it also distributes the vertices over the surface in a fair way. That is, each vertex lies as close as possible to the center of gravity of its immediate neighbors. The least-squares meshes (LS-meshes) are a visually smooth and fair approximation of the given control points. We show that the connectivity of the mesh contains geometric information that affects the shape of the reconstructed surface. Finally, we discuss the applicability of LS-meshes to approximation of given surfaces, smooth completion and mesh editing.

[1]  Gregory M. Nielson,et al.  Scattered Data Interpolation and Applications: A Tutorial and Survey , 1991 .

[2]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[3]  Joe Warren,et al.  Subdivision Methods for Geometric Design: A Constructive Approach , 2001 .

[4]  James F. O'Brien,et al.  Modelling with implicit surfaces that interpolate , 2005, SIGGRAPH Courses.

[5]  Bruno Lévy.  Dual domain extrapolation , 2003, ACM Trans. Graph..

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

[7]  Carlo H. Séquin,et al.  Functional optimization for fair surface design , 1992, SIGGRAPH.

[8]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

[9]  Leif Kobbelt,et al.  A variational approach to subdivision , 1996, Comput. Aided Geom. Des..

[10]  James F. Blinn,et al.  A generalization of algebraic surface drawing , 1982, SIGGRAPH.

[11]  Craig Gotsman,et al.  Spectral compression of mesh geometry , 2000, EuroCG.

[12]  O. Sorkine,et al.  High-Pass Quantization with Laplacian Coordinates , 2003 .

[13]  W. T. Tutte.  How to Draw a Graph , 1963 .

[14]  M. Ben-Chen,et al.  On the Optimality of Spectral Compression of Meshes , 2003 .

[15]  Martin Isenburg,et al.  Connectivity shapes , 2001, Proceedings Visualization, 2001. VIS '01..

[16]  Amitabh Varshney,et al.  Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[17]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

[18]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2005, SIGGRAPH Courses.

[19]  Teresa H. Y. Meng,et al.  Vertex Data Compression through Vector Quantization , 2002, IEEE Trans. Vis. Comput. Graph..

[20]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2003, ACM Trans. Graph..

[21]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.