### Citations

346 |
A Subdivision Algorithm for Computer Display of Curved Surfaces
- Catmull
- 1974
(Show Context)
Citation Context ...e definition using mathematical equations. 2. Surface approximation by planar polygonal mosaic. Several systems have been implemented to remove hidden parts for mathematically defined curved surfaces =-=[1, 2, 3, 4, 5]-=-. With these systems, exact information at each point of the surface can be obtained, and the resultCommunications June 1975 of Volume 18 the ACM Number 6ing computer generated pictures are most real... |

227 | A characterization of ten hidden-surface algorithms.
- Sutherland, Sproull, et al.
- 1974
(Show Context)
Citation Context ...ecent attempts to devise fast hidden surface algorithms have been based on the use of this approximation for curved surfaces; these algorithms have been summarized and classified by Sutherland et al. =-=[6]-=-. The next section discusses their influence on the way shading is computed. While planar approximation greatly simplifies hidden surface removal, it introduces several major problems in the generatio... |

27 |
A New Approach to the Shaded Picture Problem."
- Newell, Newell, et al.
- 1972
(Show Context)
Citation Context ...t difficult to perform effective shading on curved objects. The two major advances in the development of fast hidden surface algorithms have been made by Watkins [9] and by Newell, Newell, and Sancha =-=[10]-=-. Watkins generates the displayed picture scan line by scan line. On each scan line he computes which polygons intersect the scan line, and then computes the visible segment of each polygon, where thi... |

23 |
A real-time visible surface algorithm
- Watkins
- 1970
(Show Context)
Citation Context ...of the polygons in memory. This made it difficult to perform effective shading on curved objects. The two major advances in the development of fast hidden surface algorithms have been made by Watkins =-=[9]-=- and by Newell, Newell, and Sancha [10]. Watkins generates the displayed picture scan line by scan line. On each scan line he computes which polygons intersect the scan line, and then computes the vis... |

12 |
A Procedure for Detecting Intersections of Three- dimensional Objects
- Comba
- 1967
(Show Context)
Citation Context ...e definition using mathematical equations. 2. Surface approximation by planar polygonal mosaic. Several systems have been implemented to remove hidden parts for mathematically defined curved surfaces =-=[1, 2, 3, 4, 5]-=-. With these systems, exact information at each point of the surface can be obtained, and the resultCommunications June 1975 of Volume 18 the ACM Number 6ing computer generated pictures are most real... |

9 |
Visible Surface Algorithms for Quadric Patches
- Mahl
- 1972
(Show Context)
Citation Context ...e definition using mathematical equations. 2. Surface approximation by planar polygonal mosaic. Several systems have been implemented to remove hidden parts for mathematically defined curved surfaces =-=[1, 2, 3, 4, 5]-=-. With these systems, exact information at each point of the surface can be obtained, and the resultCommunications June 1975 of Volume 18 the ACM Number 6ing computer generated pictures are most real... |

7 |
A Package of IBM 7090 FORTRAN Program.': to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces
- Weiss, VISION
- 1966
(Show Context)
Citation Context |

5 |
A Hidden-Line Algorithm for Halftone Picture Representation,"
- Warnock
- 1968
(Show Context)
Citation Context ...The order in which a hidden surface algorithm computes visible information has a decided influence on the way shading is performed. For example Warnock, who developed one of the first such algorithms =-=[8]-=-, computed display data by a binary subdivision process: this meant that the order of generating display data was largely independent both of the order of scanning the display and of the order of the ... |

4 |
Improved Rendition of Polygonal Models of Curved Surfaces
- Phong, Crow
- 1975
(Show Context)
Citation Context ... curve. The other problem is that of shading the polygons in a realistic manner. This paper is concerned with the shading problem; the contour edge problem is discussed by the author and F.C. Crow in =-=[7]-=-. Influence of Hidden Surface Algorithms The order in which a hidden surface algorithm computes visible information has a decided influence on the way shading is performed. For example Warnock, who de... |

1 |
Applications Group Inc. 3-D simulated graphics. Datamation 14
- MAGI
- 1968
(Show Context)
Citation Context |

1 |
Computer display of curved surfaces. Dep. of Comput
- Gouraud
- 1971
(Show Context)
Citation Context ...gure 2. 3. Gouraud's shading. While working on a technique to represent curved objects made of "Coons surfaces" 313 Communications June 1975 of Volume 18 the ACM Number 6or "Bezier patches," Gouraud =-=[11]-=- developed an algorithm to shade curved surfaces. With his algorithm, a surface represented by a patch is approximated by polygonal planar facets. Gouraud computes information about the curvature of t... |