Sciweavers

3368 search results - page 522 / 674
» GRID Computing
Sort
View
CAGD
2008
98views more  CAGD 2008»
13 years 9 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
EWC
2006
101views more  EWC 2006»
13 years 9 months ago
Mesh size functions for implicit geometries and PDE-based gradient limiting
Mesh generation and mesh enhancement algorithms often require a mesh size function to specify the desired size of the elements. We present algorithms for automatic generation of a...
Per-Olof Persson
CGF
2005
78views more  CGF 2005»
13 years 9 months ago
Visual Supercomputing: Technologies, Applications and Challenges
If we were to have a Grid infrastructure for visualization, what technologies would be needed to build such an infrastructure, what kind of applications would benefit from it, and...
Ken Brodlie, John Brooke, Min Chen, David Chisnall...
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 9 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
JCAM
2011
78views more  JCAM 2011»
13 years 15 days ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters