Add to ORKGAbstract. 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
Similarity measures are used in many applications, from comparing and searching for images to proced...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
We study the problem of morphing between two polylines that represent linear geographical features l...
We introduce two new related metrics, the geodesic width and the link width, for measuring the “dist...
International audienceDistance computation between polylines is a key point to assess similarity bet...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
The subject of this paper are algorithms for measuring the similarity of patterns of line segments i...
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cr...
In this paper we present algorithms for a number of problems in geometric pattern matching where the...
We study the problem of morphing between two polylines that represent a geographical feature general...
We study the problem of morphing between two polylines that represent a geographical feature general...
We study the problem of morphing between two polylines that represent linear geographical features l...
Similarity measures are used in many applications, from comparing and searching for images to proced...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
We study the problem of morphing between two polylines that represent linear geographical features l...
We introduce two new related metrics, the geodesic width and the link width, for measuring the “dist...
International audienceDistance computation between polylines is a key point to assess similarity bet...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
We introduce a measure for computing the similarity between multiple polylines and a polygon, that c...
The subject of this paper are algorithms for measuring the similarity of patterns of line segments i...
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cr...
In this paper we present algorithms for a number of problems in geometric pattern matching where the...
We study the problem of morphing between two polylines that represent a geographical feature general...
We study the problem of morphing between two polylines that represent a geographical feature general...
We study the problem of morphing between two polylines that represent linear geographical features l...
Similarity measures are used in many applications, from comparing and searching for images to proced...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
We study the problem of morphing between two polylines that represent linear geographical features l...