Competitive Runtime Performance for Inverse Kinematics Algorithms using Conformal Geometric Algebra

An abstract characterisation of reduction operators Intuitively a reduction operation, in the sense intended in the present paper, is an operation that can be applied to inter-

Simplification algo- rithms based on iterative contraction are of particular inter- est because they have been used to construct multiresolution surface representations, and we

By studying the constraints of geometric primitives under perspective projection, and by using their 2D features in the image, we have been able to develop a method that uses 3D

Advantages of LogPSMs over other algorithms Of the many shadow map algorithms, those that achieve high performance on today’s hardware are based on perspective warping [SD02,

We implement the search for partial symmetries efficiently and robustly using a feature-based approach: We first reduce the volume to salient line features and then

• Materials are consistent across different rendering algo- rithms, whether the rendering algorithm trys to solve the full rendering equation like a global illumination algo- rithm

We have demonstrated a novel approach to large scale volume ren- dering based on distributed task-based runtime environments, an emerging trend in modern high performance computing

Our main con- tribution to the state-of-the-art in indoor reconstruction are a novel geometric context extraction approach based on the combination of color/spatial reasoning