167 results
Search Results
Now showing 1 - 10 of 167
Item Faster Phong Shading via Angular Interpolation(Blackwell Publishing Ltd and the Eurographics Association, 1989) Kuijk, AAM.; Blake, E.H.One of the most successful algorithms that brought realism to the world of 3D image generation is Phong shading. It is an algorithm for smooth shading meshes of planar polygons used to represent curved surfaces. The level of realism and depth perception that can be obtained by Phong shading is attractive for 3D CAD applications and related areas. However, per pixel computation costs which were too high and/or artifacts, introduced by some of the more efficient evaluation methods and apparent only when displaying moving objects, are major factors mat blocked the common usage of Phong shading in highly interactive applications.In this paper we present angular interpolation for Phong shading planar polygons. Angular interpolation was a method especially designed to meet requirements as imposed by special purpose hardware we developed1, but turned out to be generally applicable. The angular interpolation method appears to be very efficient and reduces artifacts when displaying moving objects. Ideally a shading algorithm imposes no need for subdivision of patches as presented by the solid modelling system. Shading calculation via angular interpolation yields such an ideal algorithm. We will describe two alternative evaluation methods that trade off evaluation cost against level of accuracy. They both can handle light source and view point at arbitrary distances, but differ in level of accuracy. As a consequence these alternative evaluation methods do impose restrictions on the topology of patches and light sources. However, generally, the limitations imposed by these alternative shading methods are much more liberal than the limitations on patch size imposed by the geometry.The most economic evaluation method we present can incrementally compute the colour intensity along a scanline by two additions per pixel. The methods presented are generally applicable and can easily be implemented in hardware.Item Algorithm for Clipping Arbitrary Polygons(Blackwell Publishing Ltd and the Eurographics Association, 1989) Andreev, Rumen D.Item Free-Form Surfaces Modeling by Evolution Simulation(Eurographics Association, 1988) Lienhardt, PascalWe present in this paper a procedural method for modeling free-form, planar surfaces subdivisions, which allows simulating evolutions of such subdivisions. This method is founded on the common principles deduced from corpuscular phenomena modeling method (particle systems), and method for vegetal trees modeling by simulation of evolution. These principles are : - use of a discrete model, which is a set of basic elements, from which time discretization is deduced, -proper activity of basic elements; these methods consists in simulating the behaviour of these elements; - characterization of modelled object evolution, which is achieved by "functions" associated to basic elements; - priority of topology over geometry. A surface is defined as a set of surface elements, supported by a rooted, planar tree. A surface is initially reduced to a point. Surface evolution characterization and control are exclusively exerted through this tree. This method is applied to image synthesis and animation of natural shapes, especially vegetal shapes.Item Computer Generation of Penrose Tilings(Blackwell Publishing Ltd and the Eurographics Association, 1988) Rangel-Mondragon, J.; Abas, S.J.Item Blending Rational B-Spline Surfaces(Eurographics Association, 1989) Bardis, L.; Patrikalakis, N.M.A method for blendin non uniform rational B-spline surface patches, either open or periodic, is developed. he blending surface is expressed in terms of an integral, bicubic B-spline patch. The blend ensures position and normal vector continuity along linkage curves to within a specified accuracy. The linkage curves are either user-defined or are obtained by offsetting the intersection of the two patches using geodesics on each patch. An example illustrates the applicability of our method.Item A Virtual Memory System Organization for Bit-Mapped Graphics Displays(The Eurographics Association, 1989) Barkans, Anthony C.; Richard Grimsdale and Wolfgang StrasserDescribed is a display sub-system, designed for support of a very high speed rendering engine. It provides high-performance graphics to an enVironment that consists of a hierarchy of resizable windows. The concept of virtual memory has been applied with the organization of the virtual to physical address spaces having a unique mapping that fits the organization of a bit-mapped graphics memory display.Item Architectures for Mass Market 3D Displays(Eurographics Association, 1988) Winser, Paul; Bonnet, Thierry; Dumont, Dominique; Mathieu, YvesWe discuss the specific architecture requirements of real time 3D display systems intended for low cost mass market products of the near future. Vertex transformation and polygon rendering are two processing aspects where hardware acceleration must be used to achieve the performance target. The use of one or more DSP chips as vertex processors is discussed, and two efficient z-buffer implementations described. Antialiasing and texture mapping greatly improve the visual impression at some processing cost.Item Variations on a Dither Algorithm(Eurographics Association, 1989) Pins, Markus; Hild, HermannMapping continuous-tone pictures into digital halftone pictures, i.e. 0/1-pictures, for printing purposes is a well explored technique. In this paper, one of these algorithms, the two-dimensional error-diffusion algorithm is extended to color pictures and animated pictures. The color picture algorithm is superior to existing algorithms by considering extreme color values as well as adjacent color values. The animation algorithm eliminates the noise created by the correct but varying pixel patterns generated by applying a single picture dithering algorithm on every frame. The power of the algorithms is demonstrated by experiments carried out on synthetic images generated by ray tracing.Item A Proposal for a Distributed Model of GKS Based on Prolog(Blackwell Publishing Ltd and the Eurographics Association, 1988) Milanese, V.The Graphical Kernel System GKS is so well established as a standard for graphics programming that quite a number of models for multiprocessor and distributed environments have already been suggested. It is therefore necessary to consider new languages and methodologies capable of supporting its distributed implementation. In this context, clausal logic languages provide suitable means for describing the system in a declarative form and, moreover, ensure the applicability of meta-programming techniques for specifying the semantics of implementation. The Prolog language, extended with communication and modularization structures required by the distributed programming, is thus here considered as a feasible means for establishing a model of GKS organized in functional modules which could be supported by different processors. For such a model a two-level implementation scheme is outlined and a reconfiguration and personalization methodology is suggested.Item A Hardware Algorithm for Fast Realistic Image Synthesis(The Eurographics Association, 1989) Yilmaz, A. C.; Hagestein, S.; Deprettere, E.; Dewilde, P.; Richard Grimsdale and Wolfgang StrasserA VLSI oriented algorithm, for the implementation of a generalized two-pass radiosity method is presented. The method allows any reflection behavior, varying from purely diffuse to perfect mirroring. Moreover, objects may be defined in terms of curved (Bezier) surfaces. All computations in the pre- and postprocess are similar and ray-tracing based, consequently a single architecture can be devised for both passes. This architecture, when built on ray-rotating and ray-tracing pipelined processors such as Cordics, results in a very high throughput VLSI implementation o f the proposed generalized two-pass procedure.