A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
2-D shape blending: an intrinsic solution to the vertex path problem
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Metamorphosis of freeform curves and surfaces
Computer graphics
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
International Journal of Computer Vision
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Snakes, shapes, and gradient vector flow
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper presents an algorithm to generate a smooth surface between two closed spatial spline curves. With the assumption that the two input curves can be projected to a single plane so that the projections do not have any mutual or self intersections, and so that one projection completely encloses the other. We describe an algorithm that generates a temporal deformation between the input curves, one which can be thought of as sweeping a surface. Instead of addressing feature matching, as many planar curve deformation algorithms do, the deformation method described generates intermediate curves that behave like wavefronts as they evolve from the shape of one boundary curve to a medial type curve, and then gradually take on the characteristics of the second boundary curve. This is achieved in a manner that assures there will be neither singularities in the parameterization nor self-intersections in the projected surface.