New similarity measures between polylines with applications to morphing and polygon sweeping

Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S B Mitchell, T. M. Murali

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

We introduce two new related metrics, the geodesic width and the link width, for measuring the "distance" between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O (n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the total number of edges of the polylines. Our computation of these metrics relies on two closely related combinatorial strutures: the shortest-path diagram and the link diagram of a simple polygon. The shortest-path (resp., link) diagram encodes the Euclidean (resp., link) shortest path distance between all pairs of points on the boundary of the polygon. We use these algorithms to solve two problems: Compute a continuous transformation that "morphs" one polyline into another polyline. Our morphing strategies ensure that each point on a polyline moves as little as necessary during the morphing, that every intermediate polyline is also simple and disjoint to any other intermediate polyline, and that no portion of the polylines to be morphed is stretched or compressed by more than a user-defined parameter during the entire morphing. We present an algorithm that computes the geodesic width of the two polylines and utilizes it to construct a corresponding morphing strategy in O(n2 log2 n) time using O(n2) space. We also give an O(n log n) time algorithm to compute a 2-approximation of the geodesic width and a corresponding morphing scheme. Locate a continuously moving target using a group of guards moving inside a simple polygon. The guards always determine a simple polygonal chain within the polygon, with consecutive guards along the chain being mutually visible. We compute a strategy that sweeps such a chain of guards through the polygon in order to locate a target. We compute in O(n3) time and O(n2) working space the minimum number r* of guards needed to sweep an n-vertex polygon. We also give an approximation algorithm, using O(n log n) time and O(n) space, to compute an integer r such that max(r - 16, 2) ≤r* ≤ r and P can be swept with a chain of r guards.

Original languageEnglish (US)
Pages (from-to)535-569
Number of pages35
JournalDiscrete and Computational Geometry
Volume28
Issue number4
DOIs
StatePublished - 2002

Fingerprint

Morphing
Sweeping
Similarity Measure
Polygon
Geodesic
Sweep
Shortest path
Simple Polygon
Diagram
Approximation algorithms
Metric
Moving Target
Approximation Algorithms
Consecutive
Euclidean
Disjoint
Entire
Target
Integer
Necessary

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology

Cite this

New similarity measures between polylines with applications to morphing and polygon sweeping. / Efrat, Alon; Guibas, Leonidas J.; Har-Peled, Sariel; Mitchell, Joseph S B; Murali, T. M.

In: Discrete and Computational Geometry, Vol. 28, No. 4, 2002, p. 535-569.

Research output: Contribution to journalArticle

Efrat, Alon ; Guibas, Leonidas J. ; Har-Peled, Sariel ; Mitchell, Joseph S B ; Murali, T. M. / New similarity measures between polylines with applications to morphing and polygon sweeping. In: Discrete and Computational Geometry. 2002 ; Vol. 28, No. 4. pp. 535-569.
@article{6a2edf5f2af44c3287ae0abbcbe35f55,
title = "New similarity measures between polylines with applications to morphing and polygon sweeping",
abstract = "We introduce two new related metrics, the geodesic width and the link width, for measuring the {"}distance{"} between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O (n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the total number of edges of the polylines. Our computation of these metrics relies on two closely related combinatorial strutures: the shortest-path diagram and the link diagram of a simple polygon. The shortest-path (resp., link) diagram encodes the Euclidean (resp., link) shortest path distance between all pairs of points on the boundary of the polygon. We use these algorithms to solve two problems: Compute a continuous transformation that {"}morphs{"} one polyline into another polyline. Our morphing strategies ensure that each point on a polyline moves as little as necessary during the morphing, that every intermediate polyline is also simple and disjoint to any other intermediate polyline, and that no portion of the polylines to be morphed is stretched or compressed by more than a user-defined parameter during the entire morphing. We present an algorithm that computes the geodesic width of the two polylines and utilizes it to construct a corresponding morphing strategy in O(n2 log2 n) time using O(n2) space. We also give an O(n log n) time algorithm to compute a 2-approximation of the geodesic width and a corresponding morphing scheme. Locate a continuously moving target using a group of guards moving inside a simple polygon. The guards always determine a simple polygonal chain within the polygon, with consecutive guards along the chain being mutually visible. We compute a strategy that sweeps such a chain of guards through the polygon in order to locate a target. We compute in O(n3) time and O(n2) working space the minimum number r* of guards needed to sweep an n-vertex polygon. We also give an approximation algorithm, using O(n log n) time and O(n) space, to compute an integer r such that max(r - 16, 2) ≤r* ≤ r and P can be swept with a chain of r guards.",
author = "Alon Efrat and Guibas, {Leonidas J.} and Sariel Har-Peled and Mitchell, {Joseph S B} and Murali, {T. M.}",
year = "2002",
doi = "10.1007/s00454-002-2886-1",
language = "English (US)",
volume = "28",
pages = "535--569",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "4",

}

TY - JOUR

T1 - New similarity measures between polylines with applications to morphing and polygon sweeping

AU - Efrat, Alon

AU - Guibas, Leonidas J.

AU - Har-Peled, Sariel

AU - Mitchell, Joseph S B

AU - Murali, T. M.

PY - 2002

Y1 - 2002

N2 - We introduce two new related metrics, the geodesic width and the link width, for measuring the "distance" between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O (n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the total number of edges of the polylines. Our computation of these metrics relies on two closely related combinatorial strutures: the shortest-path diagram and the link diagram of a simple polygon. The shortest-path (resp., link) diagram encodes the Euclidean (resp., link) shortest path distance between all pairs of points on the boundary of the polygon. We use these algorithms to solve two problems: Compute a continuous transformation that "morphs" one polyline into another polyline. Our morphing strategies ensure that each point on a polyline moves as little as necessary during the morphing, that every intermediate polyline is also simple and disjoint to any other intermediate polyline, and that no portion of the polylines to be morphed is stretched or compressed by more than a user-defined parameter during the entire morphing. We present an algorithm that computes the geodesic width of the two polylines and utilizes it to construct a corresponding morphing strategy in O(n2 log2 n) time using O(n2) space. We also give an O(n log n) time algorithm to compute a 2-approximation of the geodesic width and a corresponding morphing scheme. Locate a continuously moving target using a group of guards moving inside a simple polygon. The guards always determine a simple polygonal chain within the polygon, with consecutive guards along the chain being mutually visible. We compute a strategy that sweeps such a chain of guards through the polygon in order to locate a target. We compute in O(n3) time and O(n2) working space the minimum number r* of guards needed to sweep an n-vertex polygon. We also give an approximation algorithm, using O(n log n) time and O(n) space, to compute an integer r such that max(r - 16, 2) ≤r* ≤ r and P can be swept with a chain of r guards.

AB - We introduce two new related metrics, the geodesic width and the link width, for measuring the "distance" between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O (n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the total number of edges of the polylines. Our computation of these metrics relies on two closely related combinatorial strutures: the shortest-path diagram and the link diagram of a simple polygon. The shortest-path (resp., link) diagram encodes the Euclidean (resp., link) shortest path distance between all pairs of points on the boundary of the polygon. We use these algorithms to solve two problems: Compute a continuous transformation that "morphs" one polyline into another polyline. Our morphing strategies ensure that each point on a polyline moves as little as necessary during the morphing, that every intermediate polyline is also simple and disjoint to any other intermediate polyline, and that no portion of the polylines to be morphed is stretched or compressed by more than a user-defined parameter during the entire morphing. We present an algorithm that computes the geodesic width of the two polylines and utilizes it to construct a corresponding morphing strategy in O(n2 log2 n) time using O(n2) space. We also give an O(n log n) time algorithm to compute a 2-approximation of the geodesic width and a corresponding morphing scheme. Locate a continuously moving target using a group of guards moving inside a simple polygon. The guards always determine a simple polygonal chain within the polygon, with consecutive guards along the chain being mutually visible. We compute a strategy that sweeps such a chain of guards through the polygon in order to locate a target. We compute in O(n3) time and O(n2) working space the minimum number r* of guards needed to sweep an n-vertex polygon. We also give an approximation algorithm, using O(n log n) time and O(n) space, to compute an integer r such that max(r - 16, 2) ≤r* ≤ r and P can be swept with a chain of r guards.

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

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

U2 - 10.1007/s00454-002-2886-1

DO - 10.1007/s00454-002-2886-1

M3 - Article

AN - SCOPUS:0036973020

VL - 28

SP - 535

EP - 569

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 4

ER -