# Physics-Based B-spline Morphing

@inproceedings{Ma2010PhysicsBasedBM, title={Physics-Based B-spline Morphing}, author={Yuewen Ma and Jianmin Zheng}, year={2010} }

This paper presents a new method for automatically generating a transition between two given B-spline curves or surfaces. Rather than treating the curves or surfaces as purely geometric objects, we distribute mass, damping, elasticity onto them. For elastic objects, morphing can be formulated as a boundary-valued problem of ordinary differential equations. By using Modal Analysis, the boundary-valued problem can be solved analytically. As a result, we can create a morphing that simulates the…

No Paper Link Available

## References

SHOWING 1-10 OF 10 REFERENCES

Morphing Rational B-spline Curves and Surfaces Using Mass Distributions

- MathematicsEurographics
- 2003

A technique for designing customized morphs by attaching appropriate mass distributions to target B-spline curves and surfaces is proposed and a user interface for this morphing method is developed that is easy to use and requires no knowledge of B- splines on the part of the designer.

Good vibrations: modal dynamics for graphics and animation

- MathematicsSIGGRAPH '89
- 1989

A system which uses polynomial deformation mappings to couple a vibration-mode ("modal") representation of object dynamics together with volumetric models of object geometry to gain up to two orders of magnitude in efficiency and control temporal aliasing is described.

A physically based approach to 2–D shape blending

- MathematicsSIGGRAPH
- 1992

This paper presents a new afgorithm for smoothly blending between two 2-D polygonal shapes. The algorithm is based on a physical model wherein one of the shapes is considered to be constructed of…

Interactive Deformation Using Modal Analysis with Constraints

- EngineeringGraphics Interface
- 2003

This paper shows how manipulation, collision, and other constraints may be implemented easily within a modal framework and demonstrates that for many applications the errors introduced by linearization are acceptable, and that the resulting simulations are fast and stable even for complex objects and stiff materials.

Pyramid algorithms - a dynamic programming approach to curves and surfaces for geometric modeling

- BiologyMorgan Kaufmann series in computer graphics and geometric modeling
- 2003

Chapter 1. Foundations Chapter 2. Lagrange Interpolation and Neville's Algorithm Chapter 3. Hermite Interpolation and the Extended Neville Algorithm Chapter 4. Newton Interpolation and Difference…

Dynamic NURBS with geometric constraints for interactive sculpting

- Computer ScienceTOGS
- 1994

A dynamic generalization of the nonuniform rational B-spline (NURBS) model, which results from the numerical integration of a set of nonlinear differential equations that automatically evolve the control points and weights in response to the applied forces and constraints, is developed.

2-D shape blending: an intrinsic solution to the vertex path problem

- EngineeringSIGGRAPH
- 1993

The algorithm produces shape blends which generally are more satisfactory than those produced using linear or cubic curve paths, and can avoid the shrinkage that normally occurs when rotating rigid bodies are linearly blended.

MESH MORPHING

- Computer Science
- 2003

The goal of the work is to develop a method which works more or less automatically and which produces realistic animations and which has no need to manually specify correspondence between the source and target objects.

Shape Blending of 2 { D Piecewise Curves

- Computer Science
- 1995

This paper presents an algorithm for blending (that is, smoothly transforming between) two 2{D shapes bounded by piecewise curves which runs several times faster than splitting each curve into ve line segments and applying a polygon based shape blend algorithm.