A PLI Computer Program for Hidden Line Elimination

The elimination of lines not normally viewed during a visual perception of a three-dimensional object that is being simulated on a computer graphics display is called hidden line elimination (Fig. 1). My project consists of a PL-1 computer program which implements an algorithm for hidden line elimination written by A. Montanari and R. Galemberti published in the April 1969 issue of the Communications of the ACM

Novel Parallelization Techniques for Computer Graphics Applications

Increasingly complex and data-intensive algorithms in computer graphics applications require software engineers to find ways of improving performance and scalability to satisfy the requirements of customers and users. Parallelizing and tailoring each algorithm of each specific application is a time-consuming task and its implementation is domain-specific because it can not be reused outside the specific problem in which the algorithm is defined. Identifying reusable parallelization patterns that can be extrapolated and applied to other different algorithms is an essential task needed in order to provide consistent parallelization improvements and reduce the development time of evolving a sequential algorithm into a parallel one. This thesis focuses on defining general and efficient parallelization techniques and approaches that can be followed in order to parallelize complex 3D graphic algorithms. These parallelization patterns can be easily applied in order to convert most kinds of sequential complex and data-intensive algorithms to parallel ones obtaining consistent optimization results. The main idea in the thesis is to use multi-threading techniques to improve the parallelization and core utilization of 3D algorithms. Most of the 3D algorithms apply similar repetitive independent operations on a vast amount of 3D data. These application characteristics bring the opportunity of applying multi-thread parallelization techniques on such applications. The efficiency of the proposed idea is tested on two common computer graphics algorithms: hidden-line removal and collision detection. Both algorithms are data-intensive algorithms, whose conversions from a sequential to a multithread implementation introduce challenges, due to their complexities and the fact that elements in their data have different sizes and complexities, producing work-load imbalances and asymmetries between processing elements. The results show that the proposed principles and patterns can be easily applied to both algorithms, transforming their sequential to multithread implementations, obtaining consistent optimization results proportional to the number of processing elements. From the work done in this thesis, it is concluded that the suggested parallelization warrants further study and development in order to extend its usage to heterogeneous platforms such as a Graphical Processing Unit (GPU). OpenCL is the most feasible framework to explore in the future due to its interoperability among different platforms

An Improved Procedure for Generation of Half-Tone Computer Graphics Presentations

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB 07-67-C-019

Visual Descriptors: A Design Tool for Visual Impact Analysis

This study is concerned with the development of a practical and effective form of computer-aided analysis of the visual impact of building development in rural areas. Its contribution is fourfold. Firstly, a conceptual model has been developed for the process of seeing in the context of visual impact analysis. Secondly, a mathematical model for a consistent series of visual descriptors has been devised. Thirdly, a suitable design tool has been devised to make use of visual descriptors in visual impact analysis. Fourthly, visual descriptors have actually been implemented as computer software. The concept of visual impact analysis is defined and placed within the wider context of landscape research. The problems faced by a designer in the context of visual impact analysis are identified and the concept of a 'design tool' is introduced and defined. A number of existing computer software packages, intended or used for visual impact analysis, are reviewed critically. The concept of 'visual descriptors' as measures to be used by designers is introduced and examined critically. A conceptual model is presented for the process of seeing in the context of visual impact analysis. A range of possible measures for use as visual descriptors is presented and developed further into a series of precise definitions. A method of implementing visual descriptors is presented together with formal algorithms for the derivation of eight visual descriptors. A software package incorporating these descriptors is presented and verification and case studies of its use carried out. Visual descriptors, as implemented, are assessed for their effectiveness as a design tool for visual impact analysis.Strathclyde University Dept. of Architecture and Building Scienc

Architecture and automatized methods : criticisms on the current issues

Thesis. 1975. M.Arch.A.S.--Massachusetts Institute of Technology. Dept. of Architecture.Bibliography: leaves 101-144.by Anne Marie Fourcade.M.Arch.A.S

Template reduction of feature point models for rigid objects and application to tracking in microscope images.

This thesis addresses the problem of tracking rigid objects in video sequences. A novel approach to reducing the template size of shapes is presented. The reduced shape template can be used to enhance the performance of tracking, detection and recognition algorithms. The main idea consists of pre-calculating all possible positions and orientations that a shape can undergo for a given state space. From these states, it is possible to extract a set of points that uniquely and robustly characterises the shape for the considered state space. An algorithm, based on the Hough transform, has been developed to achieve this for discrete shapes, i.e. sets of points, projected in an image when the state space is bounded. An extended discussion on particle filters, that serves as an introduction to the topic, is presented, as well as some generic improvements. The introduction of these improvements allow the data to be better sampled by incorporating additional measurements and knowledge about the velocity of the tracked object. A partial re-initialisation scheme is also presented that enables faster recovery of the system when the object is temporarily occluded.A stencil estimator is introduced to identify the position of an object in an image. Some of its properties are discussed and demonstrated. The estimator can be efficiently evaluated using the bounded Hough transform algorithm. The performance of the stencilled Hough transform can be further enhanced with a methodology that decimates the stencils while maintaining the robustness of the tracker. Performance evaluations have demonstrated the relevance of the approach. Although the methods presented in this thesis could be adapted to full 3-D object motion, motions that maintain the same view of the object in front of a camera are more specifically studied