576 search results - page 4 / 116 » On Triangulating Dynamic Graphical Models |
SGP
2007
13 years 10 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
SIGGRAPH
2000
ACM
13 years 12 months ago
2000
ACM
Most schemes to compress the topology of a surface mesh have been developed for the lowest common denominator: triangulated meshes. We propose a scheme that handlesthe topology of...
VIS
2004
IEEE
14 years 8 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
SGP
2003
13 years 9 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
VISUALIZATION
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...