In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two...
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
We present a novel method to detect curves with unknown endpoints using minimal path techniques. Our work builds on the state of the art minimal path techniques currently used to ...
In this paper we analyze an algorithm which solves the point projection and the "inversion" problems for parametric curves and surfaces. It consists of a geometric secon...
A genetic algorithm has been developed in order to find the global minimum of platinum-palladium nanoalloy clusters. The effect of biasing the initial population and predating sp...