article Frame-to-frame coherence and the hidden surface computation: constraints for a convex world Share on Authors: H. Hubschman Computer Vision and Graphics Laboratory, Department of Electrical Engineering, McGill University, Montreal, Quebec, Canada Computer Vision and Graphics Laboratory, Department of Electrical Engineering, McGill University, Montreal, Quebec, CanadaView Profile , S. W. Zucker Computer Vision and Graphics Laboratory, Department of Electrical Engineering, McGill University, Montreal, Quebec, Canada Computer Vision and Graphics Laboratory, Department of Electrical Engineering, McGill University, Montreal, Quebec, CanadaView Profile Authors Info & Claims ACM Transactions on GraphicsVolume 1Issue 2April 1982 pp 129–162https://doi.org/10.1145/357299.357302Online:01 April 1982Publication History 28citation600DownloadsMetricsTotal Citations28Total Downloads600Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Frame-to-frame coherence is the highly structured relationship that exists between successive frames of certain animation sequences. From the point of view of the hidden surface computation, this implies that parts of the scene will become visible or invisible in a predictable fashion. In this paper the frame-to-frame coherence constraints are identified and characterized for static scenes restricted to stationary, closed, convex, nonintersecting polyhedra. The animation derives from a continuous movement of the viewer. The mathematical analysis of the constraints is geometric, and leads to a characterization of the self-occlusion relationship over a single polyhedron; and to a characterization of the occlusion or change of occlusion relationship over two polyhedra. Based on these constraints, an algorithm is presented which generates successive frames in an animation sequence.