Skip to main content
SpringerLink
Log in

A Definition of Frame-to-Frame Coherence

  • Conference paper
Computer Animation ’90

Abstract

Some hidden surface/line removal algorithms may be called “Window Algorithms”, because instead of processing the scene globally, they divide it into subspaces and solve the visibility problem in each subspace. These algorithms may capitalize on a special form of coherence, called “predictive coherence”, in which information is passed from each sub-space to the next in order to speed up the calculations. This paper establishes a parallel between these algorithms and the process of animation and describes frame-to-frame coherence as predictive coherence. A model of frame-to-frame algorithms based on these definitions is presented and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Appel, A (1967) The notion of quantitative invisibility and the machine rendering of solids. Proceedings ACM National Conference: 387–393.

    Google Scholar 

  • Appel, A (1968) Some Techniques for Shading Machine Rendering of Solids. Proceedings AFIPS, Spring Joint Computer Conference, 32: 37–45, AFIPS, Thompson Books, Washington D.C. (1968)

    Google Scholar 

  • Arvo J, Kirk D (1987) Fast ray-tracing by ray classification. ACM Computer Graphics 21 (4): 55–63

    Article  Google Scholar 

  • Atherton P (1983). A scan-line hidden surface removal procedure for Constructive Solid Geometry. ACM Computer Graphics 17 (3) pp. 73–82.

    Article  Google Scholar 

  • Badt SJ (1988) Two algorithms for taking advantage of temporal coherence in ray tracing. The Visual Computer (4): 123–132

    Google Scholar 

  • Baum DR, Wallace JR, Cohen M, Greenberg D. (1986) The back-buffer algorithm: an extention of the radiosity method to dynamic environments. The Visual Computer (2): 298–306

    Google Scholar 

  • Bronsvoort W (1987) An algorithm for visible-line and visible surface display of CSG models.The Visual Computer, 3: 176–185.

    Google Scholar 

  • Clark JH (1976) Hierarchical geometric Models for Visible Surface Algorithms. Corn. of the ACM 19 (10): 547–554.

    Article  MATH  Google Scholar 

  • Cleary JG, Wyvill G (1988) Analysis of an algorithm for fast ray tracing using uniform sapce subdivision. The Visual Computer 4: 65–83

    Article  Google Scholar 

  • Crocker GA (1987) Screen-area coherence for interactive scan-line display algorithms IEEE Computer Graphics and Applications: (9)10–17

    Google Scholar 

  • Fuchs H. Abram G., Grant B. (1983) Near Real-Time shaded display of rigid objects, ACM Computer Graphics, 17(3): 65–69

    Google Scholar 

  • Fuchs H., Kedem Z., Naylor B. (1980) On visible Surface Generation by a priori Tree structures. ACM Computer Graphics, 14 (3): 124–133

    Article  Google Scholar 

  • Fujimoto A, Tanaka T, Iwata K (1986) ARTS: an accelerated Ray-tracing system IEEE Computer Graphics and Applications, (4):16–25..

    Google Scholar 

  • Galimberti R, Montanari U (1969) An Algorithm for Hidden-line Elimination. Corn. of the ACM, 12 (4): 206–211

    Article  MATH  Google Scholar 

  • Glassner A (1984), Space division for fast ray tracing. IEEE Computer Graphics and Applications, (10) 15–22.

    Google Scholar 

  • Glassner A (1988) Spacetime raytracing for animation. IEEE Computer Graphics and Appl.: 60: 70

    Google Scholar 

  • Goldsmith J, Salmon J (1987) Automatic creation of object hierarchies for ray tracing, IEEE Computer Graphics and Applications, (5): 14–20.

    Google Scholar 

  • Grant C (1985) Integrated Analytic and temporal antialiasing for polyhedra in 4-D space, Computer Graphics 19(3)

    Google Scholar 

  • Hall R, Grenberg D (1983) A testbed for realistic image synthesis. IEEE Computer Graphics and applications, (11):10–19

    Google Scholar 

  • Hamlin G., Gear W. (1977) Raster-Scan Hidden Surface Algorithm Techniques. Computer Graphics, 11 (2): 206–213

    Article  Google Scholar 

  • Herbison-Evans D (1982) Real time animation of human figure drawings with hidden lines omitted. IEEE Computer Graphics and Applications (11):27–33,.

    Google Scholar 

  • Hornung C. (1984), A method for solving the visibility problem IEEE Computer Graphics and Applications

    Google Scholar 

  • Hubshman H. (1980) Frame-to-frame coherence and the hidden surface computations Master Thesis, Mac Gill University, Montreal, Canada.

    Google Scholar 

  • Hubshman H, Zucker S (1982) Frame-to-frame coherence and the hidden surface computations:constraints for a convex world. ACM Transactions on Graphics, 1 (2): 129–162.

    Article  Google Scholar 

  • Kaplan M. (1985) Space tracing: a constant time ray tracer. ACM Computer Graphics,Siggraph’85: tutorial notes.

    Google Scholar 

  • Kay D., Greenberg D. (1979) Transparency for Computer Synthesized Images“ ACM Computer Graphics, Vol 13, pp 158–164.

    Google Scholar 

  • Korein J, Badler N (1983) Temporal Anti-Aliasing in Computer Generated Animation. ACM Computer Graphics, Proceedings Siggraph 83, 17 (3): 377–388.

    Article  Google Scholar 

  • Loutrel P., (1970) A solution to the Hidden Line Problem for computer drawn Polyhedra, IEEE transactions on Computers, C19, 3.

    Article  Google Scholar 

  • Matsumoto H., Murakami K. (1983), Ray-tracing with Octree data structure, Proc. 28th Information Processing Conference, pp. 1535–1536.

    Google Scholar 

  • Matsushita Y. (1972), Hidden Lines Elimination for a rotating object. Communications of the ACM, 15 (4): 245–252.

    Article  MathSciNet  Google Scholar 

  • Magnemat-Thalmann N., Thalmann D. (1985) Computer Animation: Theory and Practice Springer-Verlag

    Google Scholar 

  • Newell M, Newell R, Sancha T (1972) A solution to the hidden surface problem Proceedings ACM National Conference: 443–450.

    Google Scholar 

  • Noma T, Kunii T (1985), ANIMENGINE: an Engineering Animation system, IEEE Computer Graphics and Applications (10): 24–101.

    Google Scholar 

  • Roberts L. (1963), Machine Perception of Three dimensional Solids, MIT Lincoln laboratory, TR 315.

    Google Scholar 

  • Reeves W. (1983) Particle systems–A technique for Modeling a Class of Fuzzy Objects ACM Transactions on Graphics, VI. 2, No. 2, pp 359–376

    Google Scholar 

  • Romney G (1970), Computer Assisted Assembly and Rendering of Solids, Department of Computer Science, University of Utah, TR-4–20.

    Google Scholar 

  • Rubin S, Whitted T (1980). A 3-dimensional representation for fast rendering of complex scenes ACM Computer Graphics, 14 (3): 110–123.

    Google Scholar 

  • Potmesil M, Chakravarty I (1983) Motion Blur in Computer generated images ACM Computer Graphics 17(3)

    Google Scholar 

  • Pueyo X (1986) Estudi dels algorismes de visualitzacio d’escenes tridimensionals formades per superficies corbes i mixtes utilitzant el principi d’escombrat linia a linia. Tesi Doctoral, Universitat Politecnica de Catalunya

    Google Scholar 

  • Pueyo X., Brunet P. (1987) A parametric space based scan-line algorithm for removal of bicubic surfaces. IEEE Computer Graphics and Applications (11): 17–25

    Google Scholar 

  • Shelley KI, Greenberg DP (1982) Path specification and path coherence. ACM Computer Graphics, Proceedings Siggraph 82, 16 (3): 157–166

    Article  Google Scholar 

  • Schumacker R., Brand B, Gilliland M., Sharp W. (1969) Study for applying Computer Generated Images for Visual Simulation AFHRL -TR -69–14, US Air Force Human Resources Laboratory.

    Google Scholar 

  • Speer RL, DeRose TD, Barsky BA (1986) A Theoretical and Empirical Analysis of Coherent Ray-Tracing. Proccedings Graphics Interface 86: 11–25.

    Google Scholar 

  • Sutherland IE, Sproul! RF, Shumacker RA (1974). A characterization of 10 Hidden-Surface Algorithms. ACM Computing Surveys, 6 (1): 1–55

    Article  MATH  Google Scholar 

  • Watkins C. (1970), A real time Visible Surface Algorithm, Computer Science Department, University of Utah, UTECH-CSC-70–101, June 1970.

    Google Scholar 

  • Warnock J, (1969) A Hidden Surface Algorithm for generated halftone Pictures, C.S. Tech. Report 4–15, University of Utah.

    Google Scholar 

  • Weiler K, Atherton P (1977) Hidden Surface removal using Polygon area sorting ACM Computer Graphics, 1: 214–222.

    Google Scholar 

  • Whitted T (1980) An Improved Illumination Model for shaded display, Communications of the ACM, 23 (6): 343–349.

    Article  Google Scholar 

  • Whitted T., Weimer D. (1982), A Software Testbed for the development of 3-D Raster Graphics Systems, ACM Transactions on Graphics, Vol 1, pp 43–58.

    Article  Google Scholar 

  • Wyvill G, Kunii T, Shirai Y (1986) Space division for Ray tracing in CSG, IEEE Computer Graphics and Application, (4): 28–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department de Llenguatges i Sistemes Informatics, Universitat Politècnica de Catalunya, Diagonal 647 ( ETSEIB), Barcelona, 08028, Spain

    Danièle Tost & Pere Brunet

Authors
  1. Danièle Tost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pere Brunet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre Universitaire d’Informatique, 12, rue du Lac, CH-1207, Geneva, Switzerland

    Nadia Magnenat-Thalmann

  2. Computer Graphics Lab., Swiss Federal Institute of Technology, CH-1015, Lausanne, Switzerland

    Daniel Thalmann

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Tokyo

About this paper

Cite this paper

Tost, D., Brunet, P. (1990). A Definition of Frame-to-Frame Coherence. In: Magnenat-Thalmann, N., Thalmann, D. (eds) Computer Animation ’90. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68296-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68296-7_15

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-68298-1

  • Online ISBN: 978-4-431-68296-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation