| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Barrera, Tony, et al.
(författare)
-
Connected Minimal Acceleration Trigonometric Curves
- 2005
-
Ingår i: SIGRAD 2005 The Annual SIGRAD Conference Special Theme – Mobile Graphics November 23-24, 2005 Lund, Sweden.
-
Konferensbidrag (refereegranskat)abstract
- We present a technique that can be used to obtain a series of connected minimal bending trigonometric splines that will intersect any number of predefined points in space. The minimal bending property is obtained by a least square minimization of the acceleration. Each curve segment between two consecutive points will be a trigonometric Hermite spline obtained from a Fourier series and its four first terms. The proposed method can be used for a number of points and predefined tangents. The tangent length will then be optimized to yield a minimal bending curve. We also show how both the tangent direction and length can be optimized to give as smooth curves as possible. It is also possible to obtain a closed loop of minimal bending curves. These types of curves can be useful tools for 3D modelling, etc.
|
|
| 5. |
- Barrera, T, et al.
(författare)
-
Fast Near Phong-Quality Software Shading
- 2006
-
Ingår i: WSCG'06.
-
Konferensbidrag (refereegranskat)abstract
- Quadratic shading has been proposed as a technique giving better results than Gouraud shading, but which is substantially faster than Phong shading. Several techniques for fitting a second order surface to six points have been proposed. We show in this paper how an approximation of the mid-edge samples can be done in a very efficient way. An approximation of the mid-edge vectors are derived. Several advantages are apparent when these vectors are put into the original formulation. First of all it will only depend on the vertex vectors. Moreover, it will simplify the setup and no extra square roots are necessary for normalizing the mid-edge vectors. The setup will be about three times faster than previous approaches. This makes quadratic shading very fast for interpolation of both diffuse and specular light, which will make it suitable for near Phong quality software renderings.
|
|
| 6. |
- Barrera, T, et al.
(författare)
-
Faster shading by equal angle interpolation of vectors
- 2004
-
Ingår i: IEEE Transactions on Visualization and Computer Graphics. - 1077-2626 .- 1941-0506. ; 10:2, s. 217-223
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we show how spherical linear interpolation can be used to produce shading with a quality at least similar to Phong shading at a computational effort in the inner loop that is close to that of the Gouraud method. We show how to use the Chebyshev's recurrence relation in order to compute the shading very efficiently. Furthermore, it can also be used to interpolate vectors in such a way that normalization is not necessary, which will make the interpolation very fast. The somewhat larger setup effort required by this approach can be handled through table look up techniques.
|
|
| 7. |
|
|
| 8. |
- Barrera, Tony, et al.
(författare)
-
Minimal Acceleration Hermite Curves
- 2005
-
Ingår i: Game programming gems 5. - Hingham, Massachusetts : Charles River Media, inc.. - 1584503521 ; , s. 225-231
-
Bokkapitel (populärvet., debatt m.m.)
|
|
| 9. |
- Barrera, Tony, et al.
(författare)
-
Trigonometric splines
- 2008. - 1
-
Ingår i: Game programming Gems 7. - Boston : Charles River Media. - 9781584505273 - 1584505273 ; , s. 191-198
-
Bokkapitel (populärvet., debatt m.m.)
|
|
| 10. |
- Barrera, Tony, et al.
(författare)
-
Vectorized table driven algorithms for double precision elementary functions using Taylor expansions
- 2009
-
Ingår i: APLIMAT 8th international conference. ; 2, s. 171-178
-
Konferensbidrag (refereegranskat)abstract
- This paper presents fast implementations of the inverse square root and arcsine, both in double precision. In single precision it is often possible to use a small table and one ordinary Newton-Raphson iteration to compute elementary functions such as the square root. In double precision a substantially larger table is necessary to obtain the desired precision, or, if a smaller table is used, the additional Newton-Raphson iterations required to obtain the precision often requires the evaluation of other expensive elementary functions. Furthermore, large tables use a lot of the cash memory that should have been used for the application code.Obtaining the desired precision using a small table can instead be realised by using a higher order method than the second order Newton-Raphson method. A generalization of Newton's method to higher order is Householder's method, which unfortunately often results in very complicated expressions requiring many multiplications, additions, and even divisions.We show how a high-order method can be used, which only requires a few extra additions and multiplications for each degree of higher order. The method starts from the Taylor expansion of the difference of the value of the elementary function and a starting guess value for each iteration. If the Taylor series is truncated after the second term, ordinary Newton iterations are obtained. In several cases it is possible to algebraically simplify the difference between the true value and the starting guess value. In those cases we show that it is advantageous to use the Taylor series to higher order to obtain the fast convergent method. Moreover, we will show how the coefficients of a Chebyshev polynomial can be fitted to give as little error as possible for the functions close to zero and in the same time reduce the terms in the Taylor expansion.In the paper we benchmark two example implementations of the method on the x86_64 architecture. The first is the inverse square root, where the actual table (to 12 bit precision) is provided by the processor hardware. The inverse square root is important in many application programs, including computer graphics, and explicit particle simulation codes, for instance the Monte Carlo and Molecular Dynamics methods of statistical mechanics. The other example is the arcsine function, which has a slow converging Taylor expansion and where no tables are provided by the hardware. The vectorized versions of the implementations of the inverse square root are 3.5 times faster than compiled code on the Athlon64 and about 5 times faster on the Core 2. The scalar version of the arcsine function is, depending on order and table size, between 2 and 3 times faster than the compiled code, and the vectorized version is between 3 and 4 times faster on the Athlon64, while it is between 4 and 5 times faster than the compiled version on the Core 2.
|
|
