Search Results

Now showing 1 - 10 of 114
  • 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
    Doctoral Theses in Computer Graphics
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Kjelldahl, Lars
  • 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
    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.
  • Item
    EDITORIAL
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Arnold, David; de Ruiter, Behr
  • Item
    A Survey of GKS and PfflGS Implementations October 1988
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Wyrwas, K.M.; Hewitt, W.T.
  • Item
    Call for Participation in the EUROGRAPHICS WORKING GROUP on INTELLIGENT CAD
    (Blackwell Publishing Ltd and the Eurographics Association, 1989)
  • Item
    On The Projective Invariant Representation of Conies in Computer Graphics
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Herman, Ivan
    A general formulation for conies and conic arcs for the purpose of computer graphics is given, based on principles and theorems of projective geometry. This approach allows the approximation of these curves by line segments to be postponed in the graphics output pipeline- it results in a more compact storage, faster approximation algorithms and smoother outlook of the curves.
  • Item
    Hidden Octree Node Removal as a Pipeline Process
    (Blackwell Publishing Ltd and the Eurographics Association, 1989) Heal, B.W.
    A processing pipeline solution to the generation and display of octree encoded 3-D objects is described. Particular emphasis is given to an algorithm which removes that part a of linear octree code which describes parts of the object which are invisible from a prescribed viewing position. The scope of the algorithm is restricted to viewing directions which are parallel to the Cartesian axes and to orthogonal projections. The algorithm is specifically designed to operate as a single stage within a pipeline of processes.