:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
In this paper, we propose a novel method for automatic, feature-based alignment of transmission electron microscope images that is needed for computing 3D reconstructions in elect...
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
— In this paper, we present a new algorithm for the alignment of two 3D scans. The approach uses a region-based matching technique. We make no assumptions about the initial posit...