Sciweavers

2609 search results - page 411 / 522
» Optimizing for parallelism and data locality
Sort
View
CGF
2008
227views more  CGF 2008»
15 years 5 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
SIAMSC
2008
173views more  SIAMSC 2008»
15 years 4 months ago
A Fast Iterative Method for Eikonal Equations
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
Won-Ki Jeong, Ross T. Whitaker
TVCG
1998
197views more  TVCG 1998»
15 years 4 months ago
A New Line Integral Convolution Algorithm for Visualizing Time-Varying Flow Fields
—New challenges on vector field visualization emerge as time-dependent numerical simulations become ubiquitous in the field of computational fluid dynamics (CFD). To visualize da...
Han-Wei Shen, David L. Kao
FPL
2010
Springer
148views Hardware» more  FPL 2010»
15 years 2 months ago
FEM: A Step Towards a Common Memory Layout for FPGA Based Accelerators
FPGA devices are mostly utilized for customized application designs with heavily pipelined and aggressively parallel computations. However, little focus is normally given to the FP...
Muhammad Shafiq, Miquel Pericàs, Nacho Nava...
GRAPHICSINTERFACE
2009
15 years 2 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...