DOIAbstract
AbstractWe summarize recent progress on intervertex distance problems for convex polygons, prove several new results for multiple intervertex distances and different intervertex distances, and raise open questions for further research
AbstractWe summarize recent progress on intervertex distance problems for convex polygons, prove several new results for multiple intervertex distances and different intervertex distances, and raise open questions for further research
AbstractWe give some exact formulas and some estimates for the distance to a polyhedron in a normed ...
Abstract. L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex ...
Let rC and rD be two convexdistance funtions in the plane with convex unit balls C and D. Given two ...
AbstractThirty years ago E. Altman proved that every convex n-gon (n≥3) has at least ⌊n2⌋ different ...
The minimum vertex distance between two separable convex polygons is found by an optimal algorithm w...
AbstractMany years ago Danzer resolved an open question of Erdős by constructing a convex 9-...
In a convex n-gon, let d1> d2> · · · denote the set of all distances between pairs of vertic...
We present a polynomial time algorithm for computing Fréchet distance between two simple paths on th...
Proceedings - IEEE International Conference on Robotics and Automation1785-790PIIA
It is proved that the Banach-Mazur distance between arbitrary two convex quadrangles is at most 2. T...
We describe an important class of semidefinite programming problems that has received scant attentio...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
Abstract. Let C be a convex body. By the relative distance of points p and q we mean the ratio of th...
In this paper we present approximate algorithms for matching two polygonal curves with respect to t...
AbstractThis paper discusses algorithms for computing verified convex hull and distance enclosure fo...
AbstractWe give some exact formulas and some estimates for the distance to a polyhedron in a normed ...
Abstract. L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex ...
Let rC and rD be two convexdistance funtions in the plane with convex unit balls C and D. Given two ...
AbstractThirty years ago E. Altman proved that every convex n-gon (n≥3) has at least ⌊n2⌋ different ...
The minimum vertex distance between two separable convex polygons is found by an optimal algorithm w...
AbstractMany years ago Danzer resolved an open question of Erdős by constructing a convex 9-...
In a convex n-gon, let d1> d2> · · · denote the set of all distances between pairs of vertic...
We present a polynomial time algorithm for computing Fréchet distance between two simple paths on th...
Proceedings - IEEE International Conference on Robotics and Automation1785-790PIIA
It is proved that the Banach-Mazur distance between arbitrary two convex quadrangles is at most 2. T...
We describe an important class of semidefinite programming problems that has received scant attentio...
AbstractWhat is the maximum number of unit distances between the vertices of a convex n-gon in the p...
Abstract. Let C be a convex body. By the relative distance of points p and q we mean the ratio of th...
In this paper we present approximate algorithms for matching two polygonal curves with respect to t...
AbstractThis paper discusses algorithms for computing verified convex hull and distance enclosure fo...
AbstractWe give some exact formulas and some estimates for the distance to a polyhedron in a normed ...
Abstract. L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex ...
Let rC and rD be two convexdistance funtions in the plane with convex unit balls C and D. Given two ...
Add to ORKG