| dc.contributor.author | Alia, G. | en_US |
| dc.contributor.author | Barsi, F. | en_US |
| dc.contributor.author | Martinelli, E. | en_US |
| dc.contributor.author | Tani, N. | en_US |
| dc.contributor.editor | C.E. Vandoni | en_US |
| dc.date.accessioned | 2015-09-29T08:29:33Z | |
| dc.date.available | 2015-09-29T08:29:33Z | |
| dc.date.issued | 1985 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/eg.19851023 | en_US |
| dc.description.abstract | In this paper a fast procedure is presented to fairly interpolate a given set of points, which is mainly based on the use of table look-up techniques. Storage amounts required can be easily supplied by present memories technology. Though our procedure can be applied to any interpolation method, it is well suited for a spline, using an angle as a parameter, which was defined by the authors in a previous paper. Benefits and limits of the procedure are discussed and several examples of its behaviour are given. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | TABLE LOOK-UP GRAPHlC INTERPOLAT ION | en_US |
| dc.description.seriesinformation | Eurographics Conference Proceedings | en_US |
| dc.identifier.doi | 10.2312/eg.19851023 | en_US |
