Sciweavers

5169 search results - page 850 / 1034
» Locality approximation using time
Sort
View
CAD
2005
Springer
15 years 4 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
TPDS
2008
91views more  TPDS 2008»
15 years 4 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
CGF
2005
156views more  CGF 2005»
15 years 4 months ago
Efficient Animation of Point-Sampled Thin Shells
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
Martin Wicke, Denis Steinemann, Markus H. Gross
CGF
2011
14 years 8 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
CVPR
2008
IEEE
16 years 6 months ago
People-tracking-by-detection and people-detection-by-tracking
Both detection and tracking people are challenging problems, especially in complex real world scenes that commonly involve multiple people, complicated occlusions, and cluttered o...
Mykhaylo Andriluka, Stefan Roth, Bernt Schiele