A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Scheduled Fourier volume morphing
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
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Three-dimensional distance field metamorphosis
ACM Transactions on Graphics (TOG)
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
As-rigid-as-possible shape interpolation
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Controllable morphing of compatible planar triangulations
ACM Transactions on Graphics (TOG)
Computational Geometry: Theory and Applications
Shape Blending Using the Star-Skeleton Representation
IEEE Computer Graphics and Applications
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
VIS '94 Proceedings of the conference on Visualization '94
An energy-driven approach to linkage unfolding
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
A Hybrid Robot System Guided by Computer Tomography for Percutaneous Lung Cancer Cryosurgery
ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part I
3D Topology Preserving Flows for Viewpoint-Based Cortical Unfolding
International Journal of Computer Vision
Hi-index | 0.00 |
This paper describes an algorithm for generating a guaranteed-intersection-free interpolation sequence between any pair of compatible polygons. Our algoithm builds on prior results from linkage unfolding, and if desired it can ensure that every edge length changes monotonically over the course of the interpolation sequence. The computational machinery that ensures against self-intersection is independent from a distance metric that determines the overall character of the interpolation sequence. This decoupled approach provides a powerful control mechanism for determining how the interpolation should appear, while still assuring against intersection and guaranteeing termination of the algorithm. Our algorithm also allows additional control by accommodating a set of algebraic constraints that can be weakly enforced throughout the interpolation sequence.