Sciweavers

3740 search results - page 310 / 748
» A Fast Skeletonization Method
Sort
View
109
Voted
VISUALIZATION
2002
IEEE
15 years 7 months ago
XFastMesh: Fast View-dependent Meshing from External Memory
We present a novel disk-based multiresolution triangle mesh data structure that supports paging and view-dependent rendering of very large meshes at interactive frame rates from e...
Christopher DeCoro, Renato Pajarola
CGI
1998
IEEE
15 years 7 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
SPAA
1997
ACM
15 years 7 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
SIGGRAPH
1994
ACM
15 years 7 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 7 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...