#### DMCA

## Pyramidal parametrics (1983)

### Cached

### Download Links

Venue: | Computer Graphics (SIGGRAPH ’83 Proceedings |

Citations: | 304 - 1 self |

### Citations

595 | T.: Illumination for computer generated pictures - PHONG - 1975 |

349 | Texture and reflection in computer generated images. - BLINN, NEWELL - 1976 |

84 |
A hierachical data structure for picture processing,
- TANIMOTO, PAVLIDIS
- 1975
(Show Context)
Citation Context ...ple to permit rendering. Such subdivision and analysis has been subsequently adopted to generate spatial data structures [5], which have been used to represent images [9] both for pattern recognition =-=[13]-=- and for transmission [i0], [14]. In the field of computer graphics, such data structures have been adopted for texture mapping [4], [16], and generalized to represent objects in space [Ii]. The appli... |

44 | Synthetic Texturing using Digital Filters,"
- Feibush, Levoy, et al.
- 1980
(Show Context)
Citation Context ...s into a small place). In this latter capacity, mip offers much greater speed than texturing algorithms which perform explicit convolution over an area in the texture map for each pixel rendered [I], =-=[6]-=-. Mip owes its speed in compressing texture to two factors. First, a fair amount of filtering of the original texture takes place when the mip map is first created. Second, subsequent filtering is app... |

36 |
Experiments in picture representation using regular decomposition.
- Klinger, Dyer
- 1979
(Show Context)
Citation Context ...ace ordering was sufficiently simple to permit rendering. Such subdivision and analysis has been subsequently adopted to generate spatial data structures [5], which have been used to represent images =-=[9]-=- both for pattern recognition [13] and for transmission [i0], [14]. In the field of computer graphics, such data structures have been adopted for texture mapping [4], [16], and generalized to represen... |

32 |
Automated space planning
- Eastman
- 1973
(Show Context)
Citation Context ...ntil analysis of a subsection showed that surface ordering was sufficiently simple to permit rendering. Such subdivision and analysis has been subsequently adopted to generate spatial data structures =-=[5]-=-, which have been used to represent images [9] both for pattern recognition [13] and for transmission [i0], [14]. In the field of computer graphics, such data structures have been adopted for texture ... |

17 | Octree Encoding: A New Technique for the Representation, Manipulation, and Display of Arbitrary 3-D Objects by Computer - Meagher - 1980 |

11 |
Texture tile considerations for raster graphics
- Dungan, Stenger, et al.
- 1978
(Show Context)
Citation Context ...have been used to represent images [9] both for pattern recognition [13] and for transmission [i0], [14]. In the field of computer graphics, such data structures have been adopted for texture mapping =-=[4]-=-, [16], and generalized to represent objects in space [Ii]. The application of pyramidal data to image storage and transmission may permit significant compression of the data to be stored or transmitt... |

8 |
Structured Computer Vision
- TANIMOTO, KLINGER
- 1980
(Show Context)
Citation Context ...pattern recognition and classification permits the comparison of the gross features of two-dimensional functions preliminary to the minute particulars; a good general reference on this application is =-=[12]-=-. publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific perm... |

8 |
Progressive transmission of grayscale and binary pictures by simple, efficient, and lossless encoding schemes
- Knowlton
- 1980
(Show Context)
Citation Context ...uch subdivision and analysis has been subsequently adopted to generate spatial data structures [5], which have been used to represent images [9] both for pattern recognition [13] and for transmission =-=[i0]-=-, [14]. In the field of computer graphics, such data structures have been adopted for texture mapping [4], [16], and generalized to represent objects in space [Ii]. The application of pyramidal data t... |

5 |
Private communications
- Hanrahan
- 1992
(Show Context)
Citation Context ...ds not only on the shape of the surface, but its light reflection properties (characterized by the shading formula), the position of the light source, and the position of the observer's eye. Hanrahan =-=[7]-=- expresses it in honest Greek: Ixly~(E,N,L) ~(u,v)0(x,y) dxdy where the normal, N, the light sources, L, and the eye, E, are vectors which may each be functions of U and V, and the limits of integrati... |

5 |
A Hidden-Line Algorithm for Halftone Picture Representation,"
- Warnock
- 1968
(Show Context)
Citation Context ...y the resolution at which the data is represented. The decomposition of an image by two-dimensional binary subdivision was a pioneering strategy in computer graphics for visible surface determination =-=[15]-=-. The approach was essentially a synthesisby-analysis: the image plane was subdivided into quadrants recursively until analysis of a subsection showed that surface ordering was sufficiently simple to ... |

3 |
The Aliasing Problem in Computer Synthesized Shaded Images
- Crow
- 1976
(Show Context)
Citation Context ...igure (14). The brackets at each sample represent the area of the surface over which the illumination function is integrated. This procedure is analogous to area-averaging of sampled edges or texture =-=[3]-=-. In order to generalize this approach to curved surfaces, the "sample interval" over which illumination is integrated must be modified according to the local curvature of the surface at a sample. In ... |

2 |
Recursive Generation of Hierarchical Data Structures for Multidimensional Digital Images
- Yau, Srihari
- 1981
(Show Context)
Citation Context ...ACM copyright notice and the title of the ~. Pyramidal Data Structures Pyramidal data structures may be based on various subdivisions: binary trees, quad trees, oct trees, or ndimensional hierarchies =-=[17]-=-. The common feature of these structures is a succession of levels which vary the resolution at which the data is represented. The decomposition of an image by two-dimensional binary subdivision was a... |

1 |
Texture Mapping Polygons in Perspective," NYIT Computer Graphics Lab Tech. Memo #13
- Heckbert
- 1983
(Show Context)
Citation Context ...filtered equally in X and Y. Choosing a value of D trades off aliasing against blurring, which becomes a tricky proposition as a pixel's projection in the texture map deviates from symmetry. Heckbert =-=[8]-=- suggests: Figure (2) Mip map of the flexible NYIT Test Frog. compressed by point sampling in (5) and by mipping in (6). The more general and interesting case -- continuously variable upsampling and d... |

1 |
Image Processing with Gross Information First
- Tanimoto
- 1979
(Show Context)
Citation Context ...bdivision and analysis has been subsequently adopted to generate spatial data structures [5], which have been used to represent images [9] both for pattern recognition [13] and for transmission [i0], =-=[14]-=-. In the field of computer graphics, such data structures have been adopted for texture mapping [4], [16], and generalized to represent objects in space [Ii]. The application of pyramidal data to imag... |

1 |
Pyramidal Parametrics," SIGGRAPH tutorial notes, "Advanced Image Synthesis
- Williams
- 1981
(Show Context)
Citation Context ...been used to represent images [9] both for pattern recognition [13] and for transmission [i0], [14]. In the field of computer graphics, such data structures have been adopted for texture mapping [4], =-=[16]-=-, and generalized to represent objects in space [Ii]. The application of pyramidal data to image storage and transmission may permit significant compression of the data to be stored or transmitted. Th... |