We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
We wish to endow the manifold M of smooth curves in lRn with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c0 and c1 as trajectorie...