Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    3D IMAGE SYNTHESIS ON THE CONNECTION MACHINE

    Supercomputers are coming into wider use for generating realistic imagery for commercial animation, special effects, and scientific simulation. The Connection Machine requires a more radical rethinking of rendering algorithms than previous supercomputers since it is not intended to function as a scalar processor. A fascinating mix of changes from conventional approaches is emerging. Some procedures can run virtually unchanged while others must be turned completely inside out. We have confidence in the viability of the Connection Machine as an architecture for high-end computer graphics. For complex scenes resulting in at least tens of thousands of polygons per frame, most steps of the rendering pipeline can make effective use of the massive number of processors available.

    Early approaches to massively parallel graphics systems have focused on processor per pixel organizations. We show that a dynamic mix of organizations, including processor per pixel, processor per vertex, and processor per polygon are necessary. Additionally, we note that an apparent consequence of the style of algorithm enforced by the Connection Machine is an enormously increased appetite for memory. We explore standard algorithms for image generation and note the differences that arise in an implementation for the Connetion Machine. We conclude by attempting a comparison of the viability of alternative computing environments for our application.

  • articleNo Access

    FOUR NEW EFFICIENT LOGICAL DISPLAY TECHNIQUES OF ELECTRICITY DISTRIBUTION NETWORKS

    Tracing a schematic display of an electricity distribution network is a cumbersome task and does not empower the engineer to take fast decisions to control the dynamic network because of the difficulty in reading the displayed circuits. This paper presents four different new approaches, which achieve an intelligent logical dynamically derived network connections and display for Electrical Distribution Networks. The four approaches were designed and implemented using the Object Oriented approach and programmed using Delphi graphics components. The system developed is dynamically interactive and allows switching operations as well as displays. This paper focuses on the display issues only. The logical display approaches presented in this paper eliminate the well-known difficulties of adding and retiring stations which are awkward operations in the schematic display. The four new approaches are compared in terms of speed, readability and space utilization. To our knowledge there is no similar work done previously.