IEEE Computer Graphics and Applications

Issue 3 • May 1988

Filter Results

Displaying Results 1 - 4 of 4
  • Accurate solid modeling using polyhedral approximations

    Publication Year: 1988, Page(s):14 - 28
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1226 KB)

    Although curved-surface solid modeling systems achieve a higher level of accuracy than faceted systems, they also introduce a host of topological, geometric, and numerical complications. A method for calculating accurate boundary representations of solid models is introduced that reduces the impact of these complications. The method uses a pair of bounding polyhedral approximations to enclose the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Display of surfaces from volume data

    Publication Year: 1988, Page(s):29 - 37
    Cited by:  Papers (997)  |  Patents (82)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (966 KB)

    The application of volume-rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is discussed. It is not necessary to fit geometric primitives to the sampled data; images are formed by directly shading each sample and projecting it onto the picture plane. Surface-shading calculations are performed at every voxel with local gradient vectors serving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating redundant primitives from set-theoretic solid models by a consideration of constituents

    Publication Year: 1988, Page(s):38 - 47
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (870 KB)

    Set-theoretic solid models often contain redundant primitives, which slow down rendering and other processes. They are not simple to remove, especially as there can be alternative eliminations that may not be equally desirable. Existing techniques for eliminating such redundant primitives do not fully consider the possibilities and rely on repeated evaluation of parts of the object's boundary, a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical data structures and algorithms for computer graphics. I. Fundamentals

    Publication Year: 1988, Page(s):48 - 68
    Cited by:  Papers (70)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2072 KB)

    The fundamentals of hierarchical data structures are reviewed and it is shown how they are used in the implementation of some basic operations in computer graphics. The properties of hierarchical structures are discussed, focusing on quadtrees and octrees. The latter are defined, some of the more common ways in which they are implemented are examined, and an explanation of the quadtree/octree comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE CG&A bridges the theory and practice of computer graphics. From specific algorithms to full system implementations, CG&A offers a unique combination of peer-reviewed feature articles and informal departments, including product announcements.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
L. Miguel Encarnação
The QED Group