Sciweavers

2570 search results - page 105 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
80
Voted
CAGD
2005
113views more  CAGD 2005»
14 years 10 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
RT
2005
Springer
15 years 3 months ago
Fast Exact From-Region Visibility in Urban Scenes
We present a fast exact from-region visibility algorithm for 2.5D urban scenes. The algorithm uses a subdivision of line space for identifying visibility interactions in a 2D foot...
Jirí Bittner, Peter Wonka, Michael Wimmer
MSE
2000
IEEE
110views Hardware» more  MSE 2000»
15 years 2 months ago
Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms fo...
Soo-Mok Jung, Sung-Chul Shin, Hyunki Baik, Myong-S...
ICDCS
2002
IEEE
15 years 3 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
90
Voted
RT
1998
Springer
15 years 2 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion