Sciweavers

6575 search results - page 37 / 1315
» Specializing visualization algorithms
Sort
View
FCS
2006
14 years 10 days ago
Speeeding Up Markov Chain Monte Carlo Algorithms
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...
Andras Farago
MOC
2000
86views more  MOC 2000»
13 years 10 months ago
Numerical algorithms for semilinear parabolic equations with small parameter based on approximation of stochastic equations
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
G. N. Milstein, M. V. Tretyakov
CAGD
1999
101views more  CAGD 1999»
13 years 10 months ago
Approximation algorithms for developable surfaces
By its dual representation, a developable surface can be viewed as a curve of dual projective 3-space. After introducing an appropriate metric in the dual space and restricting ou...
Helmut Pottmann, Johannes Wallner
3DPVT
2002
IEEE
169views Visualization» more  3DPVT 2002»
14 years 3 months ago
Compression of Isosurfaces for Structured Volumes with Context Modelling
In many applications surfaces with a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by...
Dietmar Saupe, Jens-Peer Kuska
VISUALIZATION
2002
IEEE
14 years 3 months ago
Efficient Compression and Rendering of Multi-Resolution Meshes
We present a method to code the multiresolution structure of a 3D triangle mesh in a manner that allows progressive decoding and efficient rendering at a client machine. The code ...
Zachi Karni, Alexander Bogomjakov, Craig Gotsman