- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 121 to 130 of 1655 (0.048 seconds)Spelling suggestions: "subject:"computer graphics."" "subject:"eomputer graphics.""
| 121 |
Conceptual and applied elements in computation visualizationWehrli, Joseph Frank January 1993 (has links)
No description available.
|
| 122 |
An empirical analysis of visible surface algorithmsHarp, Keith January 1987 (has links)
No description available.
|
| 123 |
Accelerated volume rendering via spatial/spectral analysisJean, Yves Darly 05 1900 (has links)
No description available.
|
| 124 |
Graphical modeling and animation of fractureO'Brien, James F. 08 1900 (has links)
No description available.
|
| 125 |
A statistical-model-based approach to textured image segmentationBevington, James E. 12 1900 (has links)
No description available.
|
| 126 |
Computer graphics simulation of two link flexible manipulator arm motionsLetchworth, Gary Franklin 05 1900 (has links)
No description available.
|
| 127 |
An analysis and modification of Shao's radiosity method for computer graphics image synthesisHall, David Edward 05 1900 (has links)
No description available.
|
| 128 |
The Z8000 microprocessor software for a real-time graphics colour animation display system /Kashef, Bahram. January 1983 (has links)
No description available.
|
| 129 |
Monte Carlo methods for radiosityTaft, Keith January 2002 (has links)
No description available.
|
| 130 |
A comparative analysis of the performance of floating point and integer based line drawing algorithms for raster displaysDuerksen, Joel L. January 1988 (has links)
In order to predict and analyze the performance of both floating point and integer line drawing algorithms the performance of individual instructions is examined. A select group of line drawing algorithms are implemented and timed in performance tests. An algorithms accuracy is observed along with its performance in three tests. These tests are performed on five computers for comparison. The effects of utilizing the standard code optimizer is included as an integral part of the research. / Department of Computer Science
|
Page generated in 0.0534 seconds