We study the complexity of computing the Fréchet distance (also called dog-leash distance) between two polygonal curves with a total number of n vertices. For two polygonal curves in the plane we prove an Ω(n log n) lower bound for the decision problem in the algebraic computation tree model allowing arithmetic operations and tests. Up to now only a O(n) upper bound for the decision problem was...

In this paper, we introduce a new generalization of the well-known Fréchet distance between two polygonal curves, and provide an efficient algorithm for computing it. The classical Fréchet distance between two polygonal curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-negative speeds. Here, we consider a problem instance in which t...

As a continuation from [2], some higherorder statistical dependency aspects of chaotic spreading sequences used in communication systems are presented. The autocorrelation function (ACF) of the mean-adjusted squares, termed the quadratic autocorrelation function, forms the building block of nonlinear dependence assessment of the family of spreading sequences under investigation. Explicit result...

Countable projective limits of countable inductive limits, so-called PLB-spaces, of weighted Banach spaces of continuous functions have recently been investigated by Agethen, Bierstedt and Bonet, who analyzed locally convex properties in terms of the defining double sequence of weights. We complement their results by considering a defining sequence which is the product of two single sequences. ...

Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...

using the hyers-ulam-rassias stability method, weinvestigate isomorphisms in banach algebras and derivations onbanach algebras associated with the following generalized additivefunctional inequalitybegin{eqnarray}|af(x)+bf(y)+cf(z)|  le  |f(alpha x+ beta y+gamma z)| .end{eqnarray}moreover, we prove the hyers-ulam-rassias stability of homomorphismsin banach algebras and of derivations on banach ...

We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases, we give algorithms for finding a (1 + ǫ)-factor approximation of the Fréch...

The Fréchet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Fréchet distance to more general metric spaces, which requires the leash itself to move continuously over time. For example, for curves in the punctured plan...