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,...
Interactive data visualization is inherently an iterative trial-and-error process searching for an ideal set of parameters for classifying and rendering features of interest in th...
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
Load balancing in a cluster system has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources. However, if a significant portion ...
Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (al...