## Multiresolution shape deformations for meshes with dynamic connectivity

### Cached

### Download Links

Venue: | In Computer Graphics Forum (Proc. Eurographics 2000 |

Citations: | 82 - 10 self |

### BibTeX

@INPROCEEDINGS{Kobbelt_multiresolutionshape,

author = {Leif P. Kobbelt and Thilo Bareuther and Hans-peter Seidel},

title = {Multiresolution shape deformations for meshes with dynamic connectivity},

booktitle = {In Computer Graphics Forum (Proc. Eurographics 2000},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flexible modifications of the global shape while preserving the detail information. Many schemes for modeling with multiresolution decompositions based on splines, polygonal meshes and subdivision surfaces have been proposed recently. In this paper we modify the classical concept of multiresolution representation by no longer requiring a global hierarchical structure that links the different levels of detail. Instead we represent the detail information implicitly by the geometric difference between independent meshes. The detail function is evaluated by shooting rays in normal direction from one surface to the other without assuming a consistent tesselation. In the context of multiresolution shape deformation, we propose a dynamic mesh representation which adapts the connectivity during the modification in order to maintain a prescribed mesh quality. Combining the two techniques leads to an efficient mechanism which enables extreme deformations of the global shape while preventing the mesh from degenerating. During the deformation, the detail is reconstructed in a natural and robust way. The key to the intuitive detail preservation is a transformation map which associates points on the original and the modified geometry with minimum distortion. We show several examples which demonstrate the effectiveness and robustness of our approach including the editing of multiresolution models and models with texture. 1.

### Citations

1175 | Progressive meshes - Hoppe - 1996 |

999 | Surface simplification using quadric error metrics - Garland, Heckbert - 1997 |

832 | Multi-Grid Methods and Applications - Hackbusch - 1985 |

642 |
Recursively generated b-spline surfaces on arbitrary topological meshes
- Catmull, Clark
- 1978
(Show Context)
Citation Context ...o trade, e.g., two valence 5 vertices for one valence 8 vertex. Fig. 6 shows the different stages of the restructuring process. (1) (3) Figure 6: The quality of a modified mesh (1) can be improved by =-=(2)-=- collapsing short edges, (3) splitting long edges, and (4) flipping edges where the valence excess can be reduced. The last quality requirement concerning the aspect ratio of the triangles turns out t... |

586 | Decimation of triangle meshes - Schroeder, Zarge, et al. - 1992 |

554 | A signal processing approach to fair surface design - Taubin - 1995 |

537 | Multiresolution analysis of arbitrary meshes - Eck, DeRose, et al. - 1995 |

537 | Smooth Subdivision Surfaces Based on Triangles - LOOP - 1987 |

456 | Implicit fairing of irregular meshes using diffusion and curvature flow - Desbrun, Meyer, et al. - 1999 |

367 | Mesh optimization - Hoppe - 1993 |

347 | Multiresolution Analysis for Surfaces of Arbitrary Topological Type - Lounsbery - 1993 |

329 | Geometry compression
- Deering
- 1995
(Show Context)
Citation Context ...rtex. Fig. 6 shows the different stages of the restructuring process. (1) (3) Figure 6: The quality of a modified mesh (1) can be improved by (2) collapsing short edges, (3) splitting long edges, and =-=(4)-=- flipping edges where the valence excess can be reduced. The last quality requirement concerning the aspect ratio of the triangles turns out to be automatically satisfied by the above restructuring al... |

285 | Interactive multiresolution modeling on arbitrary meshes - Kobbelt, Campagna, et al. - 1998 |

255 | Geometric compression through topological surgery - Taubin, Rossignac - 1996 |

240 | Behaviour of recursive division surfaces near extraordinary points - DOO, SABIN - 1978 |

238 | MAPS: Multiresolution adaptive parameterization of surfaces,” SIGGRAPH - Lee, Sweldens, et al. - 1998 |

237 | Spherical wavelets : Efficiently representing functions on the sphere - Schröder, Sweldens - 1995 |

224 | Multiresolution signal processing for meshes - Guskov, Sweldens, et al. |

218 | Fitting Smooth Surfaces to Dense Polygon Meshes - Krishnamurthy, Levoy - 1996 |

212 | Interpolating subdivision for meshes with arbitrary topology - Zorin, Schröder, et al. - 1996 |

191 | Hierarchical B-spline refinement - Forsey, Bartels - 1988 |

189 | Shade trees - COOK - 1984 |

187 | Interactive multiresolution mesh editing - ZORIN, SCHRDER, et al. - 1997 |

182 | Real time compression of triangle mesh connectivity - Gumhold, Straßer - 1998 |

153 | Free–Form shape design using triangulated surfaces - WELCH, WITKIN - 1994 |

141 | Interactive texture mapping - Maillot, Yahia, et al. - 1993 |

140 | Interpolatory subdivision on open quadrilateral nets with arbitrary topology - Kobbelt - 1996 |

138 | Fullrange approximation of triangulated polyhedra - RONFARD, ROSSIGNAC, et al. - 1996 |

132 | Progressive forest split compression - Taubin, Gueziec, et al. - 1998 |

121 | Optimizing triangle strips for fast rendering - Evans, Skiena, et al. - 1996 |

111 | Wavelets for Computer Graphics - Stollnitz, DeRose, et al. - 1995 |

110 | Non-distorted texture mapping for sheared triangulated meshes - LEVY, MALLET - 1998 |

86 | A general framework for mesh decimation - Kobbelt, Campagna, et al. - 1998 |

78 | A Shrink Wrapping Approach to Remeshing Polygonal Surfaces - Kobbelt, Vorsatz, et al. - 1999 |

64 | Skin: A constructive approach to modeling free-form shapes - Markosian, Cohen, et al. - 1999 |

44 |
Mesh Generation and Optimal Triangulation, Computing in Euclidean Geometry, edited by Ding-Zhu Du and Frank
- Bern, Eppstein
- 1995
(Show Context)
Citation Context ...ty d for each vertex q, e.g., by computing the average length of the adjacent edges. We then update the vertex positions for all q by the density weighted umbrella rule 19 5 q 1 ∑ j d j n 1 ∑ d j q j =-=(1)-=- j 0 where n is the valence of q and q j are its direct neighbors with their corresponding density d j. The effect of the weight coefficients is that vertices with low point density (large average edg... |

17 | Multiresolution surface reconstruction for hierarchical B-splines - FORSEY, WONG - 1995 |

12 | Interactive mesh dragging with adaptive remeshing technique - SUZUKI, SAKURAI, et al. - 1998 |

7 | Displacement mapping using flow fields - PEDERSEN - 1994 |