## Computing Visibility Without Depth (1996)

Venue: | UNC Chapel Hill |

Citations: | 14 - 0 self |

### BibTeX

@TECHREPORT{McMillan96computingvisibility,

author = {Leonard McMillan},

title = {Computing Visibility Without Depth},

institution = {UNC Chapel Hill},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper presents a visibility solution for a specific type of scene description, called a

### Citations

702 | Plenoptic modeling: An image-based rendering system
- McMillan, Bishop
- 1995
(Show Context)
Citation Context ...eference to the range values of the surface. Therefore, if the re-projection stage of the third step can also be accomplished without explicit reference to the range function, as in [McMillan95a] and =-=[McMillan95c]-=-, the projected scene's visibility can be established without any depth information. Next, several examples are given to illustrate the various enumeration directions used by the algorithm. In order t... |

550 | View interpolation for image synthesis - Chen, Williams - 1993 |

206 | A characterization of ten hidden-surface algorithms
- Sutherland, Sproull, et al.
- 1974
(Show Context)
Citation Context ... scene descriptions, there exists an algorithm for computing correct visibility solutions that requires no information about the geometric contents of the scene. 1.1 Background Sutherland and Sproull =-=[Sutherland74]-=- first realized that the task of determining visibility can be reduced to a sorting problem. In their classic taxonomy of hidden-surface algorithms, they showed that all of the previously known visibi... |

182 |
Procedural Elements for Computer Graphics
- Rogers
- 1988
(Show Context)
Citation Context ...to the visible surface at that point. The drawing process can then proceed without intermediate tests or auxiliary storage. In this respect it is similar to the classic painter's visibility algorithm =-=[Rogers85]-=-. The unique aspect of this proposed technique is that the drawing order is established independent of any information relating to the scene's geometry, including the depth information. Thus, I claim ... |

78 | 3-D Scene Representation as a Collection of Images and Fundamental Matrices
- Laveau, Faugeras
- 1994
(Show Context)
Citation Context ..., or , as shown below: Unlike range information, the generalized disparity term, , can be determined directly from observable image features, such as optical flow [Prazdny83] or point correspondences =-=[Laveau94]-=-. These two-dimensional mapping functions, , may result in several points from the domain mapping to a single point in the range. Such range points will be referred to as topological multiplicities of... |

36 | A list-priority rendering algorithm for redisplaying projected surfaces
- McMillan
- 1995
(Show Context)
Citation Context ...rate alternate views which correspond to different view positions. 2.1 Algorithm for determining correct visibility Next, an algorithm for re-projecting planar perspective-projected surfaces is given =-=[McMillan95b]-=-. First, several quantities will be defined in order to describe the algorithm. The original perspective-projected surface is defined by an initial center of projection, , and a planar projection matr... |

34 |
On the information in optical flows
- Prazdny
- 1983
(Show Context)
Citation Context ...presentation of the range information, or , as shown below: Unlike range information, the generalized disparity term, , can be determined directly from observable image features, such as optical flow =-=[Prazdny83]-=- or point correspondences [Laveau94]. These two-dimensional mapping functions, , may result in several points from the domain mapping to a single point in the range. Such range points will be referred... |

19 |
Head-tracked stereo display using image warping
- McMillan, Bishop
(Show Context)
Citation Context ...shed without any reference to the range values of the surface. Therefore, if the re-projection stage of the third step can also be accomplished without explicit reference to the range function, as in =-=[McMillan95a]-=- and [McMillan95c], the projected scene's visibility can be established without any depth information. Next, several examples are given to illustrate the various enumeration directions used by the alg... |

13 |
Hidden Line Elimination in Projected Grid Surfaces
- Anderson
- 1982
(Show Context)
Citation Context ... toward epipolar rays at infinity is handled consistently. 4.0 Discussion and Conclusions Special cases of the visibility algorithm presented in this paper have been discovered previously by Anderson =-=[Anderson82]-=- and Adelson and Hodges [Adelson93a]. Anderson 's original hidden-line algorithm handled the special case where the initial surface was defined in an euclidean space rather than a projective one. This... |

10 | A Two-Space Solution to the Hidden Line Problem for Plotting Functions o~ Two Variables - WRIGHT - 1973 |

5 | Visibility determination on projected grid surfaces - Wang, Staudhammer - 1990 |

3 | Exact Ray-Traced Animation Frames Generated by Reprojection - Adelson, Hodges - 1993 |

1 |
Stereoscopic Ray-Tracing", The Visual Computer
- Adelson, Hodges
- 1993
(Show Context)
Citation Context ... handled consistently. 4.0 Discussion and Conclusions Special cases of the visibility algorithm presented in this paper have been discovered previously by Anderson [Anderson82] and Adelson and Hodges =-=[Adelson93a]-=-. Anderson 's original hidden-line algorithm handled the special case where the initial surface was defined in an euclidean space rather than a projective one. This corresponds to setting the initial ... |