53 search results - page 7 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
WSCG
2003
13 years 9 months ago
2003
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
SIGGRAPH
1996
ACM
13 years 11 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
We present methods to obtain computationally efficient proposal distributions for Bayesian reversible jump Markov chain Monte Carlo (RJMCMC) based image segmentation. The slow con...
WSCG
2003
13 years 9 months ago
2003
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...