AbstractWe give some exact formulas and some estimates for the distance to a polyhedron in a normed linear space E. We show that in the case when E = Rn, endowed with the l∞-norm, these estimates are, in general, better than a recent estimate by Cook, Gerards, Schrijver, and Tardos [2]
AbstractIn this paper we explore the duality relations that characterize least norm problems. The pa...
AbstractWe summarize recent progress on intervertex distance problems for convex polygons, prove sev...
We consider the parameter space of all the linear inequality systems, in the n-dimensional Euclidean...
International audienceDistance Geometry puts the concept of distance at its center. The basic proble...
New upper and lower bounds for the p-angular distance in normed linear spaces are given. Some of th...
We present a polynomial time algorithm for computing Fréchet distance between two simple paths on th...
In this paper we present approximate algorithms for matching two polygonal curves with respect to t...
The Euclidean distance between two points P,Q of the Euclidean n-dimensional space En is a real valu...
AbstractIn this paper, we obtain a better estimate for the norm of inverses of Euclidean distance ma...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
We study questions concerning convexity and the existence of the nearest point for a given set in sp...
This work relates to the problem of linear approximation of multidimensional statistical data. Inste...
Given a finite set A in a normed linear space X and the integer k smaller or equal to the number of ...
AbstractTwo polyhedral convex sets A and B are considered, where A and B have the same set of defini...
We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1...
AbstractIn this paper we explore the duality relations that characterize least norm problems. The pa...
AbstractWe summarize recent progress on intervertex distance problems for convex polygons, prove sev...
We consider the parameter space of all the linear inequality systems, in the n-dimensional Euclidean...
International audienceDistance Geometry puts the concept of distance at its center. The basic proble...
New upper and lower bounds for the p-angular distance in normed linear spaces are given. Some of th...
We present a polynomial time algorithm for computing Fréchet distance between two simple paths on th...
In this paper we present approximate algorithms for matching two polygonal curves with respect to t...
The Euclidean distance between two points P,Q of the Euclidean n-dimensional space En is a real valu...
AbstractIn this paper, we obtain a better estimate for the norm of inverses of Euclidean distance ma...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
We study questions concerning convexity and the existence of the nearest point for a given set in sp...
This work relates to the problem of linear approximation of multidimensional statistical data. Inste...
Given a finite set A in a normed linear space X and the integer k smaller or equal to the number of ...
AbstractTwo polyhedral convex sets A and B are considered, where A and B have the same set of defini...
We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1...
AbstractIn this paper we explore the duality relations that characterize least norm problems. The pa...
AbstractWe summarize recent progress on intervertex distance problems for convex polygons, prove sev...
We consider the parameter space of all the linear inequality systems, in the n-dimensional Euclidean...
DOI
Add to ORKG