Filters

1987 - 1989256
Reset filters

Settings

Has files: true × Start date: 1987 × End date: 1989 ×

Search Results

Now showing 1 - 10 of 256
  • No Thumbnail Available
    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.
  • No Thumbnail Available
    Item
    Algorithm for Clipping Arbitrary Polygons
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Andreev, Rumen D.
  • Thumbnail Image
    Item
    Free-Form Surfaces Modeling by Evolution Simulation
    (Eurographics Association, 1988) Lienhardt, Pascal
    We 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.
  • No Thumbnail Available
    Item
    Computer Generation of Penrose Tilings
    (Blackwell Publishing Ltd and the Eurographics Association, 1988) Rangel-Mondragon, J.; Abas, S.J.
  • No Thumbnail Available
    Item
    Evaluation of Standard Graphics Packages
    (Blackwell Publishing Ltd and the Eurographics Association, 1987) Klok, Fopke
    In order to compare the quality of different implementations of GKS, the ISO0 standard for computer graphics, an evaluation method for GKS implementations is presented. It is based upon several groups of criteria. One group of criteria is concerned with performance, by which we understand here the memory requirements and time requirements for programs using GKS functions. A program that measures the performance of GKS packages is presented. Results of this evaluation method with several commercially available GKS implementations are described in summary. A checklist for evaluation of standard graphics packages is added as an appendix.
  • Thumbnail Image
    Item
    Ray Tracing Rational B-Spline Patches in VLSI
    (The Eurographics Association, 1987) Schneider, Bengt-Olaf; Fons Kuijk and Wolfgang Strasser
    Rational B-spline surfaces make it possible to merge the concepts of freeform surfaces and that of surfaces described by rational polynomials especially conic sections. For ray tracing it is crucial to determine the intersection between ray and object. Therefore an algorithm is developed that is suitable for a VLSI implementation. Some alternatives for the implementation of this algorithm are presented and discussed. The paper concludes with a discussion of some problems and possible further developments.
  • Thumbnail Image
    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.
  • Thumbnail Image
    Item
    A Virtual Memory System Organization for Bit-Mapped Graphics Displays
    (The Eurographics Association, 1989) Barkans, Anthony C.; Richard Grimsdale and Wolfgang Strasser
    Described 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.
  • Thumbnail Image
    Item
    Architectures for Mass Market 3D Displays
    (Eurographics Association, 1988) Winser, Paul; Bonnet, Thierry; Dumont, Dominique; Mathieu, Yves
    We 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.
  • Thumbnail Image
    Item
    Variations on a Dither Algorithm
    (Eurographics Association, 1989) Pins, Markus; Hild, Hermann
    Mapping 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.