EG1991 Proceedings (Technical Papers)
https://diglib.eg.org:443/handle/10.2312/42
EG Conference Proceedings2021-04-12T05:31:33ZA Testbed for Image Synthesis
https://diglib.eg.org:443/handle/10.2312/egtp19911035
A Testbed for Image Synthesis
Trumbore, Ben; Lytle, Wayne; Greenberg, Donald P.
Image Synthesis research combines new ideas with existing techniques. A collection of software modules that provide such techniques is extremely useful for simplifying the development process. We describe the design and implementation of a new Testbed for Image Synthesis that provides such support. This Testbed differs from previous Testbeds in both its goals and its design decisions. The Testbed design addresses the problems of high model complexity, complicated global illumination algorithms and coarse grain parallel processing environments. The implementation is modular, portable and extensible. It allows for statistical comparison of algorithms and measurement of incremental image improvements, as well as quantitative comparison of Testbed images and light reflectance measured from physical models. The Testbed is designed to interface with any available modeling system. This compatibility was achieved through careful design of the data format that represents environments. The software modules of the Testbed are organized in a hierarchical fashion, simplifying application programming.
1991-01-01T00:00:00ZSolid-Interpolating Deformations: Construction and animation of PIPs
https://diglib.eg.org:443/handle/10.2312/egtp19911037
Solid-Interpolating Deformations: Construction and animation of PIPs
Kaul, Anil; Rossignac, Jarek
Computer programs that simulate the deformations of geometric shapes have played a key role in the increasing popularity of software tools for artistic animation. Previously published techniques for specifying and animating deformations are either limited in their domain or ill suited for interactive editing and visualization. This is because the effects of alterations performed by the animator on the model's parameters may not always be anticipated, and because realtime animation may only be produced by visualizing pre-computed sequences of 3D frames, which are obtained by a slow process and require vast amounts of storage. To support an interactive environment for animation design, we have developed a new, simple, and efficient animation primitive: a Parameterized Interpolating Polyhedron, or PIP for short. PIPs are easily specified and edited by providing their initial and final shapes, which may be any polyhedra, and need not have corresponding boundary elements. PIPs may be efficiently animated on standard graphic hardware because a PIP is a smoothly varying family of polyhedra bounded by faces that evolve with time. The faces have constant orientations and vertices that each move on a straight line between a vertex of the initial shape and a vertex of the final one. The cost of recalculating the time dependant information of a PIP is small in comparison to the display cost. We provide simple and efficient algorithms, based on Minkowski sum operations, for computing PIPs. When both the initial and final shapes are convex, the resulting faces are the true boundary of the deforming object, otherwise subsets of the resulting faces may lie inside the object. In both cases, correct images are automatically generated using standard depth-buffer hardware. The tools we have developed are convenient for interactively designing animation sequences that show the metamorphosis of 3D shapes. They may also be used to simulate the geometric effect of a variety of manufacturing operations, and for interactively selecting the optimal compromise between two or more shapes. They are being integrated in the LAMBADA design and inspection environment for animated assemblies, where deformations and rigid-body motions may be easily combined and synchronized using a hierarchical representation.
1991-01-01T00:00:00ZVariable-Radius Blending by Using Gregory Patches in Geo- metric Modeling
https://diglib.eg.org:443/handle/10.2312/egtp19911038
Variable-Radius Blending by Using Gregory Patches in Geo- metric Modeling
Harada, T.; Konnoa, K.; Chiyokura, H.
Blending surfaces, which connect two curved surfaces smoothly, often appear in geometric modeling. Many of the blending surfaces are variable-radius blends. Variableradius blending surfaces are very important in the design process, but it is difficult to generate such surfaces with existing geometric modelers. This paper proposes a new method to generate variable-radius blends. Instead of the popular rolling-ball method, we adopt “sliding-circle” blending. A circle slides on two curved surfaces so that the circle is perpendicular to a specified control curve, and its trajectory defines a blending surface. A variable-radius blend can be generated if the radius of the circle changes smoothly. In our method, the shape of the variable-radius blend is represented by Gregory patches. The Gregory patch is an extension of a Bezier patch and two Gregory patches can be connected together with tangential continuity. The characteristics of the Gregory patch are suitable for representing blending surfaces with geometric modelers.
1991-01-01T00:00:00ZC 2 Gregory patch
https://diglib.eg.org:443/handle/10.2312/egtp19911036
C 2 Gregory patch
Miuraa, Kenjiro Takai; Wangb, Kuo-King
G² continuity of free-form surfaces is sometimes very important in engineering applications. The conditions for G2 continuity between two Bezier patches has been studied and methods developed to ensure such continuity. However, certain restrictions on the shapes of such patches arise within the Bezier-patch formulation. The Gregory patch is a kind of free-form surface patch which is an extension of the Bezier patch such that cross-boundary first derivatives can be specified without restrictions on the compatibility condition. In this paper, we extend the idea of the Gregory patch and develop a formulation for the C² Gregory patch. The properties of the C² Gregory patch are discussed as well as its connection with a Bezier patch and a G² continuous interpolation method based upon such patches.
1991-01-01T00:00:00Z