Morphing between polylines

Authors:
Alon Efrat;Sariel Har-Peled;Leonidas J. Guibas;T. M. Murali
Affiliations:
Room 747, Department of Computer Science, Gould-Simpson Building, The University of Arizona, PO Box 210077, Tucson, AZ;2111 DCL, 1304 West Springfield Avenue, Urbana, IL;Computer Science Dept., Stanford University, 353 Serra Mall, Stanford, CA;Compaq Computer Corporation, Cambridge Research Lab, One Cambridge Center, Cambridge, MA
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 16
Cited 5

Triangulating a simple polygon in linear time

Discrete & Computational Geometry
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
Shape transformation for polyhedral objects

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
On compatible triangulations of simple polygons

Computational Geometry: Theory and Applications
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
Morphing simple polygons

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constructing piecewise linear homeomorphisms of simple polygons

Journal of Algorithms
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
Morphing binary trees

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Sweeping simple polygons with a chain of guards

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Shape Blending Using the Star-Skeleton Representation

IEEE Computer Graphics and Applications
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Wavelet-based volume morphing

VIS '94 Proceedings of the conference on Visualization '94

Refolding planar polygons

Proceedings of the twenty-second annual symposium on Computational geometry
Fréchet distance for curves, revisited

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An Implicit Method for Interpolating Two Digital Closed Curves on Parallel Planes

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
b-morphs between b-compatible curves in the plane

2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
An approximate morphing between polylines

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two non-intersecting simple polylines in the plane, we study the problem of continuously transforming or morphing one polyline into the other. Our morphing strategies have the desirable property that every intermediate polyline is also simple. We also guarantee that no portion of the polylines to be morphed is stretched or compressed by more than a user-defined parameter during the entire morphing. Our algorithms are based on the morphing width, a new metric we have developed for measuring the similarity between two polylines. We develop an algorithm that computes the morphing width of the two polylines and constructs a corresponding morphing strategy in &Ogr;(n2 log2 n) time using &Ogr;(n2) space, where n is the total number of vertices in the polylines. We describe another algorithm that computes a factor-2 approximation of the morphing width and a corresponding morphing scheme in &Ogr;(n log n) time.