12 search results - page 1 / 3 » An empirical comparison of techniques for updating Delaunay ... |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
URBAN
2008
13 years 4 months ago
2008
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...
JODL
2006
13 years 4 months ago
2006
Recent advances in technology have made tremendous amount of multimedia information available to the general population. An efficient way of dealing with this new development is t...
SGP
2003
13 years 6 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...