Sciweavers

346 search results - page 26 / 70
» On the sizes of Delaunay meshes
Sort
View
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
14 years 8 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
COMPGEOM
2005
ACM
13 years 9 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
CGI
2004
IEEE
13 years 11 months ago
Physically-Based Simulation of Objects Represented by Surface Meshes
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
Matthias Müller, Matthias Teschner, Markus H....
DCC
2003
IEEE
14 years 7 months ago
Compression-Domain Editing of 3D Models
3D models have become an essential element of multimedia applications because they provide visual effects that permit interactive exploration. As in other media types, efficient c...
Tulika Mitra, Tzi-cker Chiueh
SPDP
1991
IEEE
13 years 11 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari