We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
Abstract— In this paper we address the problem of determining the relative pose of pairs robots that move on a plane while measuring the distance to each other. We show that the ...
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...