Specifying varying speeds and temporal relationships is necessary when programming
graphical animations, but support for temporal programming has usually been done by adding
new language features to a Visual Programming Language (VPL), and these features must be
mastered over and above the other aspects of the VPL. However, some researchers have
believed that time should be able to be treated like just another dimension. In this thesis, we
explore whether temporal programming can indeed be done using exactly the same devices as
in spatial programming in grid-oriented VPLs. Toward this end, we provide a continuum of
models aimed at this goal and discuss their advantages and disadvantages. Also, we identify
core issues that help illuminate the essence of the problem. / Graduation date: 2001
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/33429 |
| Date | 20 June 2000 |
| Creators | Cao, Nanyu |
| Contributors | Burnett, Margaret M. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0019 seconds