Incremental computation via function caching
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The algorithmic beauty of plants
The algorithmic beauty of plants
Handbook of theoretical computer science (vol. B)
The object instancing paradigm for linear fractal modeling
Proceedings of the conference on Graphics interface '92
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
The VRML 2.0 handbook: building moving worlds on the web
The VRML 2.0 handbook: building moving worlds on the web
Term rewriting and all that
Realistic modeling and rendering of plant ecosystems
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic execution and program testing
Communications of the ACM
The use of positional information in the modeling of plants
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
OpenGL Reference Manual: The Official Reference Document to OpenGL, Version 1.2
OpenGL Reference Manual: The Official Reference Document to OpenGL, Version 1.2
| Hi-index | 0.00 |
FL-systems are conditional rewriting systems. They are used for programming (describing) and evaluating (generating) huge 3D virtual environments, such as cities and forests. This paper presents a formal semantics and a dynamic dependency analysis for FL-systems. This analysis allows the characterization of a set of terms which are joinable with the currently rewritten term. Consequently, it is possible to speed up the rewriting steps of the environments generation by using a cache mechanism which is smarter than standard ones. This work can be seen as a dynamic completion of a set of rewriting rules. This completion increases the number of terms which are rewritten in normal form by the application of a single rewriting rule.