“Scalable freeform deformation” by Boubekeur, Sorkine-Hornung and Schlick

  • ©Tamy Boubekeur, Olga Sorkine-Hornung, and Christophe Schlick




    Scalable freeform deformation



    Freeform deformation techniques are powerful and flexible tools for interactive 3D shape editing. However, while interactivity is the key constraint for the usability of such tools, it cannot be maintained when the complexity of either the 3D model or the applied deformation exceeds a given workstation-dependent threshold. In this work, we solve this scalability problem by introducing a streaming system based on a sampling-reconstruction approach. First a fast out-of-core adaptive simplification algorithm is performed in a pre-processing step, for quick generation, of a simplified version of the model. The resulting model can then be submitted to arbitrary FFD tools, as its reduced size ensures interactive response. Second, a post-processing step performs a feature-preserving deformation reconstruction that applies to the original model the deformation undergone by its simplified version. Both bracketing steps share a streaming and point-based basis, making them fully scalable and compatible both with point-clouds and non-manifold meshes. Our system also offers a generic out-of-core multi-scale layer to FFD tools, since the two bracketing steps remain available for partial up-sampling during the interactive session. Arbitrarily large 3D models can thus be interactively edited with most FFD tools, opening the use of advanced deformation metaphors to models ranging from million to billion samples. Our system also enables offers to work on models that fit in memory but exceed the capabilities of a given FFD tool.


    1. Boubekeur, T., Heidrich, W., Granier, X., and Schlick, C. 2006. Volume-surface trees. Computer Graphics Forum v25, n3, p399–406.
    2. Heidrich, W. 2005. Computing the barycentric coordinates of a projected point. Journal of Graphics Tools v10, n3, p9–12.
    3. Isenburg, M., Liu, Y., Shewchuk, J., and Snoeyink, J. 2006. Streaming computation of delaunay triangulations. ACM Trans. Graph. v25, n3, p1049–1056.

ACM Digital Library Publication:

Overview Page: