150 search results - page 19 / 30 » Flipping Edges in Triangulations |
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
Abstract. We show that we can e ectively t arbitrarily complex animation models to noisy image data. Our approach is based on leastsquares adjustment using of a set of progressivel...
TVCG
2012
11 years 10 months ago
2012
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
TVCG
2008
13 years 7 months ago
2008
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We use the abbreviations tet and tri for tetrahedron and triangle. TetStreamer encodes a Delaunay tet mesh in a back-to-front visibility order and streams it from a server to a cl...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...