| Gobbetti E (1993) Virtuality Builder II. PhD Thesis, EPFL, Switv. erland. |
....animation subsystem of Virtual Studio. First, we present the object model and describe the class hierarchy of the animation subsystem. Then, we show how the animation behavior is obtained using hierarchical data flow constraints. Other aspects of Virtual Studio are presented elsewhere: references [13] [14] presents the underlying graphics architecture (named VB) references [1] 2] 15] provides a general overview of the animation system, and references [1] 3] detail the data reduction algorithm. 2 Object Model 2.1 Primitive Elements In Virtual Studio, there is no intrinsic difference between ....
....Constraint methods can be general sideeffect free procedures that ensure the satisfaction of the constraint, after their execution, by computing some of the constrained variables as a function of the others. Constraints are maintained using an efficient local propagation algorithm based on Skyblue [13] [14] 19] a domain independent solver able to maintain a hi erarchy of multi way, multi output dataflow constraints. The main drawback of such a local propagation algorithm is the limitation to acyclic onstraint graphs. However, as noted by Sannella et al. 21] cyclic constraint networks are ....
[Article contains additional citation context not shown here]
Gobbetti E (1993) Virtuality Builder II. PhD Thesis, EPFL, Switv. erland.
....animation subsystem of Virtual Studio. First, we present the object model and describe the class hierarchy of the animation subsystem. Then, we show how the animation behavior is obtained using hierarchical data flow constraints. Other aspects of Virtual Studio are presented elsewhere: references [13][14] presents the underlying graphics architecture (named VB2) references [1] 2] 15] provides a general overview of the animation system, and references [1] 3] detail the data reduction algorithm. 2 Object Model 2.1 Primitive Elements In Virtual Studio, there is no intrinsic difference between ....
....Constraint methods can be general sideeffect free procedures that ensure the satisfaction of the constraint, after their execution, by computing some of the constrained variables as a function of the others. Constraints are maintained using an efficient local propagation algorithm based on Skyblue [13][14] 19] a domain independent solver able to maintain a hierarchy of multi way, multi output dataflow constraints. The main drawback of such a local propagation algorithm is the limitation to acyclic onstraint graphs. However, as noted by Sannella et al. 21] cyclic constraint networks are ....
[Article contains additional citation context not shown here]
Gobbetti E (1993) Virtuality Builder II. PhD Thesis, EPFL, Switzerland.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC