Morphing between polylines

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

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

17 Citations (Scopus)

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 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 Annual ACM-SIAM Symposium on Discrete Algorithms
Pages680-689
Number of pages10
StatePublished - 2001
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: Apr 30 2001May 1 2001

Other

Other2001 Operating Section Proceedings, American Gas Association
CountryUnited States
CityDallas, TX
Period4/30/015/1/01

Fingerprint

Morphing
Entire
Metric
Approximation

Keywords

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

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Efrat, A., Har-Peled, S., Guibas, L. J., & Murali, T. M. (2001). Morphing between polylines. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 680-689)

Morphing between polylines. / Efrat, Alon; Har-Peled, Sariel; Guibas, Leonidas J.; Murali, T. M.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 680-689.

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

Efrat, A, Har-Peled, S, Guibas, LJ & Murali, TM 2001, Morphing between polylines. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 680-689, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.
Efrat A, Har-Peled S, Guibas LJ, Murali TM. Morphing between polylines. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 680-689
Efrat, Alon ; Har-Peled, Sariel ; Guibas, Leonidas J. ; Murali, T. M. / Morphing between polylines. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. pp. 680-689
@inproceedings{29c420631b0840989204525ba4e7dc0a,
title = "Morphing between polylines",
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 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.",
keywords = "Algorithms, Design, Measurement, Performance, Theory, Verification",
author = "Alon Efrat and Sariel Har-Peled and Guibas, {Leonidas J.} and Murali, {T. M.}",
year = "2001",
language = "English (US)",
isbn = "0898714907",
pages = "680--689",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

T1 - Morphing between polylines

AU - Efrat, Alon

AU - Har-Peled, Sariel

AU - Guibas, Leonidas J.

AU - Murali, T. M.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Algorithms

KW - Design

KW - Measurement

KW - Performance

KW - Theory

KW - Verification

UR - http://www.scopus.com/inward/record.url?scp=0005507893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0005507893&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0898714907

SP - 680

EP - 689

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -