• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 926
  • 172
  • 93
  • 66
  • 33
  • 32
  • 32
  • 32
  • 32
  • 32
  • 30
  • 30
  • 12
  • 8
  • 6
  • Tagged with
  • 1656
  • 1656
  • 253
  • 199
  • 188
  • 165
  • 158
  • 152
  • 147
  • 145
  • 144
  • 143
  • 143
  • 139
  • 121
  • 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.

Mathematical aspects of a graphical programming language and its implementation

Chan, Bon-boon January 1976 (has links)
This thesis describes the improvements in the mathematical aspects of the high-level programming language for interactive graphics (LIG). Improvement possibilities were investigated in three areas: dependence on the order of transformations, arithmetic expressions appearing in LIG statements, and the implementation to allow the programming of graphical functions. The method of implementation of the proposed improvements is also discussed. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Concepts for a high level programming language for regional computer graphics

Liu, Bobby Hin Wah January 1979 (has links)
Researchers developing high-level graphics languages have, according to the literature, focused their attention towards line-drawing graphics. Little effort has been devoted to systematic investigations of languages that handle graphical data representing line-drawings as well as solid areas. The latter type of graphical data is usually represented hy outlines, and solid area properties are visualized by hatching or filling techniques. A study of the literature on programming languages leads to the conclusion that graphical data should be treated as a data type. Based on the concept of treating graphical data as a data type in its own right, the mathematical and conceptual aspects of this type of data are investigated and established. Much scattered information, such as the representation of regions, has been unified using formal descriptions. Hatching, one of the many ways of achieving external representation of regions, is also investigated. A hatching algorithm is proposed and implemented that envelops the good features of others, and establishes a framework for hatching algorithms. Its implementation achieves the expected tasks. A proposal for a graphics language demonstrates the usefulness and feasibility of this type of graphics. Some of its features have been implemented. Finally, a fairly complete bibliography serves as a gateway for further research in this area. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Unknown

Interactive least squares surface fitting

Samsom, Anthony Harm January 1980 (has links)
This thesis is concerned with the design and implementation of a surface fitting package in an interactive graphics environment. Surface fitting techniques are used to generate a smooth looking, easy to evaluate, bivariate function given a set of data points on some domain in the plane, and are thus useful for a variety of applications. We consider the implementation of a surface fitting technique using weighted least squares with tensor products of B-splines on regular data grids (i.e. the position of the data points can be represented as the cross product of two vectors). While somewhat more restrictive than other surface fitting methods, this technique, when applicable, is extremely efficient. Knot placement and weight placement are discussed as methods of adapting the spline surface to rapidly varying regions on the domain. A disadvantage of the original method used to solve for the coefficients of the spline surface is that the domain of the function to be approximated must be rectangular. An algorithm to extend the surface fitting method to non-rectangular domains, thus removing this restriction, is presented. An interactive surface fitting package is provided, which allows a user to fit a spline surface to a set of data points on a regular grid. This provides a powerful tool which may be used to effectively modify the spline surface and indicate the accuracy of the approximation. / Science, Faculty of / Computer Science, Department of / Graduate

Data entry methods for an urban graphics database

Joobbani, Rostam January 1977 (has links)
No description available.

A class of perfect graphs /

Hoang, Trong Chinh. January 1983 (has links)
No description available.

The design and construction of a disc oriented graphics system.

Fabi, Ronald James. January 1971 (has links)
No description available.

A general purpose graphics system for a small computer.

McNeil, Timothy O'Brien. January 1973 (has links)
No description available.

Computer Graphics in Rapid Prototyping Technology

Stucki, P., Bresenham, J.E., Earnshaw, Rae A. January 1995 (has links)

Adaptive difference of gaussian algorithm for coherent line drawing

Kurniawan, Abadi. January 1900 (has links)
Title from title page of PDF (University of Missouri--St. Louis, viewed February 23, 2010). Includes bibliographical references (p. 33-35).

Efficient, parallel level-of-detail rendering of meshes /

Hu, Liang. January 2009 (has links)
Includes bibliographical references (p. 51-57).

Page generated in 0.0559 seconds