Programming Paradigms in Graphics

A hierarchical structuring of graphical scenes corresponds to many real world metaphors and implies an ease of use. But, due to the limited resources of graphical systems, graphical scenes are often created as directed acyclic graphs and, therefore, are loosing the advantages of hierarchies. This paper explores the requirements of various rendering methods with regard to the organization of the graphical scene, and sets up rendering-independent modelling requirements for a generic graphics kernel. Finally, it describes a solution for a specific graphics kernel that is strongly based on hierarchical structures but avoids redundancies in a high degree.

[1]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[2]  Edwin H. Blake,et al.  OOCS - Constraints in an Object Oriented Environment , 1994, Workshop on Object-Oriented Graphics.

[3]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[4]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[5]  Bjørn N. Freeman-Benson,et al.  Integrating Constraints with an Object-Oriented Language , 1992, ECOOP.

[6]  Ivan E. Sutherland,et al.  Sketchpad: a man-machine graphical communication system , 1899, AFIPS '63 (Spring).

[7]  Vicki de Mey,et al.  Object-Oriented Programming for Graphics , 1995, Focus on Computer Graphics.

[8]  Michael Sannella,et al.  Constraint satisfaction and debugging for interactive user interfaces , 1994 .

[9]  Grady Booch,et al.  Object-Oriented Analysis and Design with Applications , 1990 .

[10]  Michèle Soria,et al.  Complexity Analysis of Term-Rewriting Systems , 1989, Theor. Comput. Sci..

[11]  Jan van den Bos,et al.  Propagators and concurrent constraints , 1991, OOPS Messenger.

[12]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[13]  Michael R. Wilk.  Equate: an object-oriented constraint solver , 1991, OOPSLA 1991.

[14]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[15]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[16]  Hans W. Guesgen,et al.  Some Fundamental Properties of Local Constraint Propagation , 1988, Artif. Intell..

[17]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[18]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.