We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the...
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, Dav...
In modern architectures based on Web Services or Cloud Computing, a very large number of user requests arrive concurrently and has to be scheduled for execution constrained by cor...
We describe spatio-temporal symmetry and its extraction via a Generalised Symmetry Operator. Its use in gait recognition is reinforced by the view from psychology that human gait ...
James B. Hayfron-Acquah, Mark S. Nixon, John N. Ca...