H
:[0, 1]× 3→ 3, where H(t, r) for t=0 and t=1 are two given planar curves C 1(r) and C 2(r). The first t parameter defines the time of fixing the intermediate metamorphosis curve. The locus of H(t, r) coincides with the ruled surface between C 1(r) and C 2(r), but each isoparametric curve of H(t, r) is self-intersection free. The second algorithm suits morphing operations of planar curves. First, it constructs the best correspondence of the relative parameterizations of the initial and final curves. Then it eliminates the remaining self-intersections and flips back the domains that self-intersect.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Samoilov, T., Elber, G. Self-intersection elimination in metamorphosis of two-dimensional curves. The Visual Computer 14, 415–428 (1998). https://doi.org/10.1007/s003710050152
Issue Date:
DOI: https://doi.org/10.1007/s003710050152