Morphing between polylines

Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 log 2 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Number of pages10
StatePublished - 2001
Externally publishedYes
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: Apr 30 2001May 1 2001

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms


Other2001 Operating Section Proceedings, American Gas Association
Country/TerritoryUnited States
CityDallas, TX


  • Algorithms
  • Design
  • Measurement
  • Performance
  • Theory
  • Verification

ASJC Scopus subject areas

  • Software
  • General Mathematics


Dive into the research topics of 'Morphing between polylines'. Together they form a unique fingerprint.

Cite this