## Hidden Surface Removal Using Polygon Area Sorting (1977)

Venue: | Computer Graphics |

Citations: | 79 - 0 self |

### BibTeX

@INPROCEEDINGS{Weiler77hiddensurface,

author = {Kevin Weiler and Peter Atherton},

title = {Hidden Surface Removal Using Polygon Area Sorting},

booktitle = {Computer Graphics},

year = {1977},

pages = {214--222}

}

### Years of Citing Articles

### OpenURL

### Abstract

A polygon hidden surface and hidden line removal algorithm is presented. The algorithm recursively subdivides the image into polygon shaped windows until the depth order within the window is found. Accuracy of the input data is preserved. The approach is based on a two-dimensional polygon clipper which is sufficiently general to clip a concave polygon with holes to the borders of a concave polygon with holes. A major advantage of the algorithm is that the polygon form of the output is the same as the polygon form of the input. This allows entering previously calculated images to the system for further processing. Shadow casting may then be performed by first producing a hidden surface removed view from the vantage point of the light source and then resubmitting these tagged polygons for hidden surface removal from the position of the observer. Planar surface detail also becomes easy to represent without increasing the complexity of the hidden surface problem. Translucency is also possible. Calculation times are primarily related to the visible complexity of the final image, but can range from a linear to an exponential relationship with the number of input polygons depending on the particular environment portrayed. To avoid excessive computation time, the implementation uses a screen area subdivision preprocessor to create several windows, each containing a specified number of polygons. The hidden surface algorithm is applied to each of these windows separately. This technique avoids the difficulties of subdividing by screen area down to the screen resolution level while maintaining the advantages of the polygon area sort method.

### Citations

246 |
Machine Perception of Three Dimensional Solids
- Roberts
- 1963
(Show Context)
Citation Context ...le within a prescribed area on the output display, usually a raster dot. The "list-priority" algorithms work partially in each of these two domains.sThe performance of "object space" methods (Roberts =-=[8]-=-, Appel [1], Galimberti [4]) and "listpriority" methods (Newell, Newell and Sancha [7], Schumacher [9]) is dependent on the complexity of the environment. Since all of these algorithms make comparison... |

200 | A characterization of ten hiddensurface algorithms
- Sutherland, Sproull, et al.
- 1974
(Show Context)
Citation Context ...a fee. Siggraph ’77, July 20-22 San Jose, California 214 Many visible surface algorithms have been developed, each with unique characteristics and capabilities. A survey presented by Sutherland et al =-=[11]-=- provides a method of categorization as well as a statistical comparison of many of the polygon based algorithms. Their classification divides the algorithms into three types: object space, image spac... |

66 | The Notion of Quantitative Invisibility and the Machine Rendering of Solids
- Appel
- 1967
(Show Context)
Citation Context ... prescribed area on the output display, usually a raster dot. The "list-priority" algorithms work partially in each of these two domains.sThe performance of "object space" methods (Roberts [8], Appel =-=[1]-=-, Galimberti [4]) and "listpriority" methods (Newell, Newell and Sancha [7], Schumacher [9]) is dependent on the complexity of the environment. Since all of these algorithms make comparisons between i... |

60 |
Reentrant polygon clipping
- Sutherland, Hodgman
(Show Context)
Citation Context ...ling concave polygons with holes is necessary. A clipping algorithm capable of clipping concave polygons with holes to the inside portion of a convex area has been described by Sutherland and Hodgman =-=[10]-=-. The algorithm has the merit of simplicity and is particularly useful for screen subdivision and viewbox clipping. A modified version of this algorithm would clip polygons to a plane and create outpu... |

56 |
A hidden-surface algorithm for, computer generated half-tone pictures
- Warnock
- 1969
(Show Context)
Citation Context ...umber of input items. However, the computational time is independent of the resolution or size of the image. In contrast, the "image-space" algorithms make polygon to screen area comparisons (Warnock =-=[12]-=-, Watkins [13], Bouknight [3], and depth map or Z-buffer algorithms). Therefore, the number of sorting steps is possibly linear with the number of input polygons, but can vary exponentially with the r... |

47 | A solution to the hidden surface problem
- Newell, Newell, et al.
- 1972
(Show Context)
Citation Context ...ority" algorithms work partially in each of these two domains.sThe performance of "object space" methods (Roberts [8], Appel [1], Galimberti [4]) and "listpriority" methods (Newell, Newell and Sancha =-=[7]-=-, Schumacher [9]) is dependent on the complexity of the environment. Since all of these algorithms make comparisons between items (objects, polygons, edges), the number of sorting steps required can r... |

43 |
D.: Polygon shadow generation
- ATHERTON, WEILER, et al.
- 1978
(Show Context)
Citation Context ...the output is possible, this particular technique shows promise of being useful not only for display purposes, but also for engineering applications such as energy analyses related to solar heat gain =-=[2]-=-. Translucent Polygons Translucent polygons can be represented with a slight modification of the depth culling portion of the algorithm. When a translucent polygon becomes the clip polygon, polygons w... |

22 |
A procedure for generation of three-dimensional half-toned computer graphics presentations
- Bouknight
- 1970
(Show Context)
Citation Context ... the computational time is independent of the resolution or size of the image. In contrast, the "image-space" algorithms make polygon to screen area comparisons (Warnock [12], Watkins [13], Bouknight =-=[3]-=-, and depth map or Z-buffer algorithms). Therefore, the number of sorting steps is possibly linear with the number of input polygons, but can vary exponentially with the resolution required. The algor... |

20 |
A real-time visible surface algorithm
- Watkins
- 1970
(Show Context)
Citation Context ... items. However, the computational time is independent of the resolution or size of the image. In contrast, the "image-space" algorithms make polygon to screen area comparisons (Warnock [12], Watkins =-=[13]-=-, Bouknight [3], and depth map or Z-buffer algorithms). Therefore, the number of sorting steps is possibly linear with the number of input polygons, but can vary exponentially with the resolution requ... |

7 |
Study for Applying Computer Generated Images to Visual Simulation
- Schumacker, Brand, et al.
- 1969
(Show Context)
Citation Context ...s work partially in each of these two domains.sThe performance of "object space" methods (Roberts [8], Appel [1], Galimberti [4]) and "listpriority" methods (Newell, Newell and Sancha [7], Schumacher =-=[9]-=-) is dependent on the complexity of the environment. Since all of these algorithms make comparisons between items (objects, polygons, edges), the number of sorting steps required can rise exponentiall... |

5 |
An algorithm for hidden-line elimination
- Galimberti
- 1969
(Show Context)
Citation Context ... on the output display, usually a raster dot. The "list-priority" algorithms work partially in each of these two domains.sThe performance of "object space" methods (Roberts [8], Appel [1], Galimberti =-=[4]-=-) and "listpriority" methods (Newell, Newell and Sancha [7], Schumacher [9]) is dependent on the complexity of the environment. Since all of these algorithms make comparisons between items (objects, p... |

2 |
An Interdisciplinary Laboratory for Graphics Research and Applications
- Greenberg
- 1977
(Show Context)
Citation Context ...e greatest potential in reducing overal computation time. IMPLEMENTATION The hidden surface and hidden line removal system described has been implemented at Cornell's Laboratory for Computer Graphics =-=[5]-=-. The program was written in FORTRAN IV and runs on a PDP 11/50 with a floating point processor under the RSX-11M operating system. The available display equipment includes both static and dynamic vec... |

1 | An Efficient Visible Surface Program - Myers - 1975 |