Spelling suggestions: "subject:"eomputer 3dgraphics."" "subject:"eomputer andgraphics.""
291 |
An empirically derived system for high-speed shadow renderingRautenbach, Pierre. January 2009 (has links)
Thesis (MSc (Computer science))--University of Pretoria, 2008. / Includes bibliographical references.
|
292 |
GPU-based implementation of real-time system for spiking neural networks /Yudanov, Dmitri. January 2009 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 145-149).
|
293 |
An object oriented curve and surface framework /Jacobson, Alan L., January 1993 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 130-134). Also available via the Internet.
|
294 |
Tangent-ball techniques for shape processingWhited, Brian Scott. January 2009 (has links)
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010. / Committee Chair: Jarek Rossignac; Committee Member: Greg Slabaugh; Committee Member: Greg Turk; Committee Member: Karen Liu; Committee Member: Maryann Simmons. Part of the SMARTech Electronic Thesis and Dissertation Collection.
|
295 |
A geometric framework for computer graphics addressing, modeling, visibility, and shadowsGhali, Sherif. January 1900 (has links)
Thesis (Ph.D.)--University of Toronto. / Title from screen (viewed March 26, 2003). Includes bibliographical references.
|
296 |
Making digital painting organic /Chu, Siu-Hang. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 103-112). Also available in electronic version.
|
297 |
Color in three-dimensional shaded computer graphics and animation /Collery, Michael T. January 1900 (has links)
Thesis (M.A.)--Ohio State University, 1985. / Includes bibliographical references (leaves 44-45).
|
298 |
Murray polygons as a tool in image processingPharasi, Bhuwan January 1990 (has links)
This thesis reports on some applications of murray polygons, which are a generalization of space filling curves and of Peano polygons in particular, to process digital image data. Murray techniques have been used on 2-dimensional and 3-dimensional images, which are in cartesian/polar co-ordinates. Attempts have been made to resolve many associated aspects of image processing, such as connected components labelling, hidden surface removal, scaling, shading, set operations, smoothing, superimposition of images, and scan conversion. Initially different techniques which involve quadtree, octree, and linear run length encoding, for processing images are reviewed. Several image processing problems which are solved using different techniques are described in detail. The steps of the development from Peano polygons via multiple radix arithmetic to murray polygons is described. The outline of a software implementation of the basic and fast algorithms are given and some hints for a hardware implementation are described The application of murray polygons to scan arbitrary images is explained. The use of murray run length encodings to resolve some image processing problems is described. The problem of finding connected components, scaling an image, hidden surface removal, shading, set operations, superimposition of images, and scan conversion are discussed. Most of the operations described in this work are on murray run lengths. Some operations on the images themselves are explained. The results obtained by using murray scan techniques are compared with those obtained by using standard methods such as linear scans, quadtrees, and octrees. All the algorithms obtained using murray scan techniques are finally presented in a menu format work bench. Algorithms are coded in PS-algol and the C language.
|
299 |
Texture mapping acceleration using cache memoriesKouropalatis, John January 2001 (has links)
No description available.
|
300 |
Methods towards achieving emotional figure animationDensley, Daniel Joseph January 1998 (has links)
No description available.
|
Page generated in 0.0433 seconds