40 results
Search Results
Now showing 1 - 10 of 40
Item Constructive Page Description Opening Up the Prepress World(Eurographics Association, 1991) Samara, Veronika; Wiedling, Hans-PeterConstructive Page Description (CPD) is an overall approach allowing different kinds of data to be exchanged between a variety of systems and manipulated in arbitrary system environments. Fully changeable pages, which keep information for modification as long as necessary, as well as fully assembled pages, ready for the printing process, can be constructed by the use of CPD. Moreover, descriptions of data as well as operations can be distributed, and so allow the use of networking facilities. CPD is thereby very flexible in handling, combining, and exchanging data and operations used in the construction of pages. In sum, CPD helps bridge the gap between the printing and the computer graphics world; it is an approach to lead prepress towards an open system architecture.Item Refinement criteria for adaptive stochastic ray tracing of textures(Eurographics Association, 1991) van Walsum, Theo; van Nieuwenhuizen, Peter R.; Jansen, Frederik W.Adaptive stochastic ray tracing is a rendering technique that generates high-quality anti-aliased images by sampling the image in a non-regular pattern that is adaptively refined. Image refinement can be guided by image space or object space criteria. For display of textures, additional criteria that operate in texture space can be added to further improve image quality. In this paper three texture space refinement criteria are introduced. The methods minimize the chance of sampling errors at the cost of only a small amount of preprocessing and are comparable in efficiency with existing texture prefiltering methods.Item Several approaches to implement the merging step of the split and merge region segmentation(Eurographics Association, 1991) Popovic, M.; Chantemargue, F.; Canals, R.; Bonton, P.The purpose of this paper is to propose several approaches for the implementation of the merging step of split and merge region segmentation. The splitting step has already been studied and its parallelization has subsequently been implemented on a transputer network. First, the most widely known merging step is described. Then, two approaches which are better suited to a parallelization are presented. Next we discuss the principle behind these approaches. Finally region segmentation according to motionbased criteria has been chosen in order to provide results to evaluate the performance of each approach. We emphasize that the description is general and can be applied to all split and merge algorithms. Therefore this work is a contributory factor in the evolution of region segmentation towards its parallelization.Item Variable-Radius Blending by Using Gregory Patches in Geo- metric Modeling(Eurographics Association, 1991) 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.Item Integrating Inheritance and Composition in an Objective Presentation Model for Multiple Media(Eurographics Association, 1991) Took, RogerA formal model is presented which combines, in a single structure called a tangle, the power to express both the composition of aggregate objects, and the selective inheritance of object properties over a number of instances or manifestations. The model allows an objective implementation, that is, one in which objects can be created and updated randomly, incrementally, and dynamically. Such a model is ideal as the basis for interactive presentation. The tangle is defined as generic in its node type, and so can model the structure of multiple presentation media.Item Using temporal and spatial coherence for accelerating the calculation of animation sequences(Eurographics Association, 1991) Gröller, Eduard; Purgathofer, WernerRay tracing is a well known technique for generating realistic images. One of the major drawbacks of this approach are the extensive computational requirements for image calculation. When generating animation sequences frame by frame the computational cost might easily become intolerable. In the last years several methods have been devised for accelerating the computational speed by using spatial and temporal coherence. While these techniques work only under certain restrictions, a new approach is presented in this paper which leads to a considerable speed-up of the calculation process without putting any limitations on camera or object movement. In principle, the method is an extension of /ArKi87/, where rays are considered points in 5D space, by the time dimension. CSG is used for object description and has been modified correspondingly to allow easy use of coherence properties. The paper describes the theoretical background and the main concepts of a practical implementation.Item A DDA Octree Traversal Algorithm for Ray Tracing(Eurographics Association, 1991) Sung, KelvinA spatial traversal algorithm for ray tracing that combines the memory efficiency of an octree and the traversal speed of a uniform voxel space is described. A new octree representation is proposed and an implementation of the algorithm based on that representation is presented. Performance of the implementation and other spatial structure traversal algorithms are examined.Item Tessellation of Curved Surfaces under Highly Varying Transformations(Eurographics Association, 1991) Abi-Ezzi, Salim S.; Shirman, Leon A.We pursue the problem of step size determination for tessellating arbitrary degree polynomial and rational Bezier patches, under highly varying modeling and viewing transformations, to within post-viewing size and/or deviation thresholds specified in display coordinates. The technique involves the computation of derivative bounds of surfaces in modeling coordinates, and the mapping of these bounds into world coordinates (or lighting coordinates), where tessellation takes place by using norms of modeling transformations. A key result of this work is a closed form expression for the maximum scale a perspective transformation is capable of at an arbitrary point in space. This result allows the mapping of thresholds from DC into WC (LC). In practice, while the step size determination needs to take place during every traversal, the costly operations of finding derivative bounds, computing norms of modeling transformations, and factoring viewing transformations take place at creation time.Item Fast Rendering of General Ellipses(Eurographics Association, 1991) Fellner, Dieter W.; Helmberg, ChristophEven though GKS did not include circles and, in a more general form, ellipses and elliptical arcs in the list of elementary graphics primitives, CGM settled this omission with its standardization in 1987. According to CGM as well as to CGI, ellipses and elliptical arcs are defined in a very general way via endpoints of conjugate diameter pairs (CDP). Based on the algorithm of Maxwell & Baker [5] this paper presents a new algorithm for the rendering of general ellipses (i.e. not aligned to the coordinate axes) and elliptical arcs which is not only fast and very well suited for implementation in hardware but also deals with all degenerate cases of ellipses at no extra cost. Furthermore, the algorithm provides all the information which is necessary for the generation of anti-aliased elliptical curves.Item Constructive Cubes: CSG Evaluation For Display Using Discrete 3-D Scalar Data Sets(Eurographics Association, 1991) Breen, David E.The algorithm presented in this paper converts a CSG model into a representation for interactive display on an engineering workstation. Called Constructive Cubes, the algorithm extends the standard CSG-point classification algorithm and then employs a popular isosurface generation algorithm, Marching Cubes, to generate a list of polygons that approximates the surface of a CSG model. The polygons may then be interactively displayed, shaded and inspected on a workstation. The algorithm has many advantages over other CSG algorithms. It is straightforward to implement, requiring no complex surface intersection calculations. The algorithm provides an inherent flexibility that allows a user to balance the time/quality trade-off. It is designed to take advantage of current and future advances in both visualization and engineering workstation design.