We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Real-time evaluation of distributed contact forces between rigid or deformable 3D objects is a key ingredient of 6-DoF force-feedback rendering. Unfortunately, at very high tempora...
Abstract. Deformable image registration in the presence of considerable contrast differences and large-scale size and shape changes represents a significant challenge for image r...
Linh K. Ha, Marcel Prastawa, Guido Gerig, John H. ...