Sciweavers

17 search results - page 2 / 4
» Fast Moreau envelope computation I: numerical algorithms
Sort
View
SGP
2004
13 years 9 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
ISCAS
2006
IEEE
81views Hardware» more  ISCAS 2006»
14 years 1 months ago
Equivalent output-filtering using fast QRD-RLS algorithm for burst-type training applications
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
Mobien Shoaib, Stefan Werner, J. A. Apoliná...
CGF
2005
232views more  CGF 2005»
13 years 7 months ago
Algorithms for Interactive Editing of Level Set Models
Level set models combine a low-level volumetric representation, the mathematics of deformable implicit surfaces, and powerful, robust numerical techniques to produce a novel appro...
Ken Museth, David E. Breen, Ross T. Whitaker, Sean...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Fitted BVH for Fast Raytracing of Metaballs
Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the vi...
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Lo...
DAC
1997
ACM
13 years 11 months ago
Methodology for Behavioral Synthesis-Based Algorithm-Level Design Space Exploration: DCT Case Study
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
Miodrag Potkonjak, Kyosun Kim, Ramesh Karri