Dissertations / Theses: 'Computer graphics – Computer programs'

1

MacAllister, Craig M. "Computer graphics adaptation of several aerodynamic prediction programs." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25766.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Miller, Maranda L. "MLM graphics : the creation of a software framework for graphical applications." Virtual Press, 2000. http://liblink.bsu.edu/uhtbin/catkey/1178343.

Full text

Abstract:

This thesis describes the process of writing a software application geared toward developing computer graphics in the Windows environment. The code is written using Visual C++ and the Microsoft Foundation Classes (MFC). As an illustration of this process we will walk through the development of a software application. This application will allow a user to create and edit an image composed of simple line graphics and geometric shapes. The user can select drawing colors, select drawing styles, and do area filling. This application also illustrates the use of menus and dialog boxes.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

3

Luo, Xueyi. "A tool for computer verification of properties of certain classes of visibility graphs." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897510.

Full text

Abstract:

Segment endpoint visibility graph is a representation scheme for art gallery problems, guard problems, and other shortest path or shortest circuit problems. In the research of visibility graphs, drawing graphs is a time-consuming task. VGE (Visibility Graphs Editor) is developed for visibility graphs reseacheres to create and modify graphs interactively in X-window environment. Appropriate graphics user interface allows the researcher to edit a graph, save and open a file, and make a hard copy of a graph. VGE is developed in C under X-window environment and using EZD[3] graphics tool. The thesis also discusses the uses of EZD. Although it is still only a prototype, VGE is a successful tool for analyzing visibility graphs.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

4

Bilderback, Mark Leslie. "Graphics.c, a simplified graphics application programming interface for the X Window environment." Virtual Press, 1995. http://liblink.bsu.edu/uhtbin/catkey/935938.

Full text

Abstract:

An often overlooked area of graphics is the ability of application programs to create graphical images. Many programs exist which allow creation interactively, but few offer the same ability for noninteractive application programs. By allowing an application program to create graphical images more user friendly programs may be created by programmers.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

5

Noll, Noland LeRoy 1958. "GRAPHICS TERMINAL EMULATION ON THE PC." Thesis, The University of Arizona, 1987. http://hdl.handle.net/10150/276550.

Full text

Abstract:

The HP2623 graphics terminal emulator is implemented on the PC for use with the Starbase graphics package provided on the departmental HP9000 series 500 computer system. This paper discusses the development and implementation of this emulator. A demonstration of its compatibility with Starbase is also provided along with a users' manual and a programmers' reference.

APA, Harvard, Vancouver, ISO, and other styles

6

Kondo, Boubacar. "An investigation of parallel algorithms developed for graph problems and their implementation on parallel computers." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/770951.

Full text

Abstract:

With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

7

Vemuri, Suresh P. "Jedit : a graph editor in Java." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1036185.

Full text

Abstract:

There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

8

Keating, Marla Jo Matlick. "Computers in college art and design programs /." Online version of thesis, 1992. http://hdl.handle.net/1850/11630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mulder, Jan A. "Using discrimination graphs to represent visual knowledge." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25943.

Full text

Abstract:

This dissertation is concerned with the representation of visual knowledge. Image features often have many different local interpretations. As a result, visual interpretations are often ambiguous and hypothetical. In many model-based vision systems the problem of representing ambiguous and hypothetical interpretations is not very specifically addressed. Generally, specialization hierarchies are used to suppress a potential explosion in local interpretations. Such a solution has problems, as many local interpretations cannot be represented by a single hierarchy. As well, ambiguous and hypothetical interpretations tend to be represented along more than one knowledge representation dimension limiting modularity in representation and control. In this dissertation a better solution is proposed. Classes of objects which have local features with similar appearance in the image are represented by discrimination graphs. Such graphs are directed and acyclic. Their leaves represent classes of elementary objects. All other nodes represent abstract (and sometimes unnatural) classes of objects, which intensionally represent the set of elementary object classes that descend from them. Rather than interpreting each image feature as an elementary object, we use the abstract class that represents the complete set of possible (elementary) objects. Following the principle of least commitment, the interpretation of each image feature is repeatedly forced into more restrictive classes as the context for the image feature is expanded, until the image no longer provides subclassification information. This approach is called discrimination vision, and it has several attractive features. First, hypothetical and ambiguous interpretations can be represented along one knowledge representation dimension. Second, the number of hypotheses represented for a single image feature can be kept small. Third, in an interpretation graph competing hypotheses can be represented in the domain of a single variable. This often eliminates the need for restructuring the graph when a hypothesis is invalidated. Fourth, the problem of resolving ambiguity can be treated as a constraint satisfaction problem which is a well researched problem in Computational Vision. Our system has been implemented as Mapsee-3, a program for interpreting sketch maps. A hierarchical arc consistency algorithm has been used to deal with the inherently hierarchical discrimination graphs. Experimental data show that, for the domain implemented, this algorithm is more efficient than standard arc consistency algorithms.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

10

Kulambi, Srinath B. "Exploring graphical primitive attributes." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/834629.

Full text

Abstract:

The basic building blockss of all graphical output are primitives such as polyline, polymarker, text, cell array and fill area. These primitives have additional data associated with them to render visual effect on the display surface of a workstation. I have explored and analyzed these primitives and implemented them by routines written in C language for IBM and IBM Compatible Personal Computers. Some of the algoriths for these routines were integrated and implemented in the Extensible Graphics Software(EGS). EGS is a prototype graphics system developed by the faculty and students of Ball State University to study and research graphics systems.I have created a font for English alphabets and digit characters. The font and any algorithms created in this thesis would be included and implemented for further development of EGS.An effective attempt is made in this thesis to show how a graphics system could be developed with a minimal dependency on hardware of computers.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

11

Mu, Xiaohua. "The design and implementation of Graphperfect : a graph editor for G-net." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834616.

Full text

Abstract:

There is an increasing demand for a computer graphics - oriented software package for graph theory teaching and research. G-Net, a department research project headed by Dr. Kunwarjit Bagga, is an effort to create a computer software that contains a graph theory database, a graph editor, and a collection of algorithms to be executed on the graphs. This thesis concentrates on the design and implementation of a graph editor - GrapliPerfect. Graphs have been widely used to model many other phenomena. In this thesis, computer generated graphics images are used to represent graphs. This modeling relation between graphs and graphics is analyzed, and its role in the design and implementation of GraphPerfect is discussed in the thesis. To enhance the friendliness of the user interface, a simplified window system is presented.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

12

Ramakrishnan, S. "A functional approach to graphics programming and modeling." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-04212010-092917/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Penn, Michael. "A visualization of an experiment on a shake table." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/30272.

Full text

Abstract:

A model to enable a graphics presentation of an experiment has been developed. The model was developed specifically for experiments run on a shake table for earthquake simulating tests but could be used for any experiment that involves movement and instrumentation. By integrating the results obtained from the instruments used during an experiment it is possible to display, on a computer screen, the motion of the model being tested. By use of visualization techniques it is possible to obtain a graphical representation of all the instruments being used and thereby producing a picture of the entire experiment.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

14

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Haag, Roger. "Programming the INTEL 8086 microprocessor for GRADS : a graphic real-time animation display system." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Fox, Timothy Stephen. "A three dimensional object rendering system." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/834152.

Full text

Abstract:

This Creative Project has investigated current methods being used to produce computer animation. This investigation has resulted in the creation of a computer rendering program capable of generating animation. In order for the program to be able to execute though, a model of the object to be viewed must first be specified. This is done by assembling together a series of graphic primitives that when viewed collectively, form the desired model. Next, the rendering software is told where to point an imaginary camera in space. This camera is used to focus the image found in the viewfinder onto the computer monitor. Lastly, the imaginary camera is provided with a three dimensional path to follow as it tracks its way through space. By combining this data with the rendering software, a person viewing the resulting computer animation is able to interact with the computer model.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

17

Woyak, Scott A. "A motif-like object-oriented interface framework using PHIGS." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09052009-040824/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kreiner, Barrett. "Issues of implementing X windows on a non-X windows device." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/770950.

Full text

Abstract:

X windows is a graphic display management system. It is designed to work on a variety of machines and display adapters, however it is not designed for terminals with local graphics capabilities. X windows can be made to work on this type of terminal, although in a slower and restricted form. The problem with designing a variation of X for these terminals is the translation from X requests to native graphics commands, and the mapping of terminal input into X events. These implementation issues are discussed and example code is provided.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

19

Crowfoot, Norman C. "A visual aid for designing regular expression parsers /." Online version of thesis, 1988. http://hdl.handle.net/1850/10446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Jog, Bharati E. "An Interface Program Between Computer Graphics and Energy Analysis." Thesis, The University of Arizona, 1985. http://hdl.handle.net/10150/559295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Luo, Zegang. "Real time cloth modeling using parallel computing /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?MECH%202005%20LUO.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Babic, Kristopher T. "InterDraw - An Online, Interactive, Collaborative Art Program." Digital WPI, 2000. https://digitalcommons.wpi.edu/etd-theses/825.

Full text

Abstract:

InterDraw is an art program that facilitates the artistic collaboration of multiple users. The goal of this collaboration is the creation of one unique computer image that represents a combination of the ideas and images provided by each of the users. InterDraw extends the already collaborative nature of the World Wide Web through the use of the Java programming language, which provides InterDraw with its cross-platform capabilities. Previously, collaborative art-like programs have been developed for specific operating systems or environments. This limitation prohibits any collaboration with users from other operating systems or environments. InterDraw breaks this limitation by using the power of Java to provide program access from any computer with an Internet connection and a Java enabled browser. The InterDraw clients collaborate by transforming objects drawn by a user into compressed binary strings that are then transported over the Internet to a server application. This server maintains a database of artist contributions and updates all other InterDraw clients collaborating on the same image. These binary strings provide a reliable transmission format that allows the drawn objects to be recreated by the InterDraw clients. Through user testing, InterDraw has been shown to provide an effective and entertaining forum for the creation of collaborative, dynamic images.

APA, Harvard, Vancouver, ISO, and other styles

23

Chan, John Tak Yan. "An interactive computer graphics package for power system analysis based on two-dimensional projections on the voltge space /." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Prasad, P. Saravana. "Tool path plotting using Plot10." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pei, Mo Mo. "Modeling the performance of many-core programs on GPUs with advanced features." Thesis, University of Macau, 2012. http://umaclib3.umac.mo/record=b2592954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ganguli, Nitu. "The design considerations for display oriented proportional text editors using bit-mapped graphics display systems /." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hsieh, Chao-Ho. "Implementation of graph manipulation under X Window system environment." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834634.

Full text

Abstract:

In graph theory graphs are mathematical objects that can be used to model networks, data structures, process scheduling, computations and a variety of other systems where the relations between the objects in the system play a dominant role.We will now consider graphs as mathematically self-contained units with rich structure and comprehensive theory; as models for many phenomena, particularly those arising in computer systems; and as structures which can be processed by a variety of sophisticated and interesting algorithms.For graph theory presentation, we need a very good graphical user interface(GUI) to approach the goal. X Window system is ideally suited for such a purpose. This package program is based on X Window system environment. With this package, we can manipulate graphs by special functions which can put nodes, put edges, delete nodes, delete edges, change the whole graph size, move graph location, and modify edge weights.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

28

Hanlon, Sebastien, and University of Lethbridge Faculty of Arts and Science. "Visualizing three-dimensional graph drawings." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2006, 2006. http://hdl.handle.net/10133/348.

Full text

Abstract:

The GLuskap system for interactive three-dimensional graph drawing applies techniques of scientific visualization and interactive systems to the construction, display, and analysis of graph drawings. Important features of the system include support for large-screen stereographic 3D display with immersive head-tracking and motion-tracked interactive 3D wand control. A distributed rendering architecture contributes to the portability of the system, with user control performed on a laptop computer without specialized graphics hardware. An interface for implementing graph drawing layout and analysis algorithms in the Python programming language is also provided. This thesis describes comprehensively the work on the system by the author—this work includes the design and implementation of the major features described above. Further directions for continued development and research in cognitive tools for graph drawing research are also suggested.
viii, 110 leaves : ill. (some col.) ; 29 cm.

APA, Harvard, Vancouver, ISO, and other styles

29

Schaefer, Charles Robert. "Magnification of bit map images with intelligent smoothing of edges." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9950.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mansey, Pradeep P. "A PHIGS based graphics interface for MECSYN." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/53139.

Full text

Abstract:

This thesis presents the development of an interactive graphics interface for MECSYN, a planar mechanism synthesis program. The purpose of this work is to produce a dynamic graphics interface, independent of a graphics device and providing a high level of user interaction. To achieve this, the proposed three-dimensional graphics standard PHIGS (Programmers Hierarchical Interactive Graphics System) is used for graphics support software. An overview of the synthesis theory is presented. The program structure is described and presented along with a listing of the graphics and interface routines of the program to aid in future development of the program (synthesis routines are not included). Several examples illustrating the features and use of the program have been included.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

31

Horn, Carin E. "Visual Literacy in Computer Culture: Reading, Writing, and Drawing Logo Turtle Graphics." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc798048/.

Full text

Abstract:

This study seeks to explore relationships between Logo turtle graphics and visual literacy by addressing two related questions: (a) can traditional visual literacy concepts, as found in the published literature, be synthesized in terms of Logo turtle graphics, and (b) do the literature and "hands-on" experience with turtle graphics indicate that visual competencies are pertinent to graphics-based electronic communications in computer culture? The findings of this research illustrate that Logo turtle graphics is a self-contained model to teach visual literacy skills pertinent to computer culture. This model is drawn from synthesizing published literature and the classroom experience of Logo learners, which is demonstrated through their visual solutions to Logo assignments. A visual analysis and interpretation of the subjects' work concludes that the principles and competencies associated with traditional visual literacy skills manifest during the Logo turtle graphics experience. The subjects of this study demonstrate that visual literacy pertinent to computer culture includes reading, writing, and drawing alphanumerics and pictographic information with linguistic equivalence. The logic for this symbolic metaphor is body-syntonic spatial experience explained in geometric terms. The Logo learner employs computational models for visual ideas and visual-verbal symbols for spatial ideas in the course of doing turtle graphics.

APA, Harvard, Vancouver, ISO, and other styles

32

Zhang, Chenggang, and 张呈刚. "Run-time loop parallelization with efficient dependency checking on GPU-accelerated platforms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47167658.

Full text

Abstract:

General-Purpose computing on Graphics Processing Units (GPGPU) has attracted a lot of attention recently. Exciting results have been reported in using GPUs to accelerate applications in various domains such as scientific simulations, data mining, bio-informatics and computational finance. However, up to now GPUs can only accelerate data-parallel loops with statically analyzable parallelism. Loops with dynamic parallelism (e.g., with array accesses through subscripted subscripts), an important pattern in many general-purpose applications, cannot be parallelized on GPUs using existing technologies. Run-time loop parallelization using Thread Level Speculation (TLS) has been proposed in the literatures to parallelize loops with statically un-analyzable dependencies. However, most of the existing TLS systems are designed for multiprocessor/multi-core CPUs. GPUs have fundamental differences with CPUs in both hardware architecture and execution model, making the previous TLS designs not work or inefficient when ported to GPUs. This thesis presents GPUTLS, a runtime system designed to support speculative loop parallelization on GPUs. The design of GPU-TLS addresses several key problems encountered when adapting TLS to GPUs: (1) To reduce the possibility of mis-speculation, deferred-update memory versioning scheme is adopted to avoid mis-speculations caused by inter-iteration WAR and WAW dependencies. A technique named intra-warp value forwarding is proposed to respect some inter-iteration RAW dependencies, which further reduces the mis-speculation possibility. (2) An incremental speculative execution scheme is designed to exploit partial parallelism within loops. This avoids excessive re-executions and reduces the mis-speculation penalty. (3) The dependency checking among thousands of speculative GPU threads poses large overhead and can easily become the performance bottleneck. To lower the overhead, we design several e_cient dependency checking schemes named PRW+BDC, SW, SR, SRW+EDC, and SRW+LDC respectively. (4) We devise a novel parallel commit scheme to avoid the overhead incurred by the serial commit phase in most existing TLS designs. We have carried out extensive experiments on two platforms with different NVIDIA GPUs, using both a synthetic loop that can simulate loops with different characteristics and several loops from real-life applications. Testing results show that the proposed intra-warp value forwarding and eager dependency checking techniques can improve the performance for almost all kinds of loop patterns. We observe that compared with other dependency checking schemes, SR and SW can achieve better performance in most cases. It is also shown that the proposed parallel commit scheme is especially useful for loops with large write set size and small number of inter-iteration WAW dependencies. Overall, GPU-TLS can achieve speedups ranging from 5 to 105 for loops with dynamic parallelism.
published_or_final_version
Computer Science
Master
Master of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

33

Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Goff, Roger Allen. "Complexity measurement of a graphical programming language and comparison of a graphical and a textual design language." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45686.

Full text

Abstract:

For many years the software engineering community has been attacking the software reliability problem on two fronts. First via design methodologies, languages and tools as a precheck on quality and second by measuring the quality of produced software as a postcheck. This research attempts to unify the approach to creating reliable software by providing the ability to measure the quality of a design prior to its implementation. Also presented is a comparison of a graphical and a textual design language in an effort to support cognitive science research findings that the human brain works more effectively in images than in text.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

35

Montgomery, David Eric. "An interactive PHIGS+ model rendering system applied to postprocessing of spatial mechanisms." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-03242009-040504/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Iheanacho, Chiemeka Clement Jr. "Effects of Two Multimedia Computer-Assisted Language Learning Programs on Vocabulary Acquisition Of Intermediate Level ESL Students." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/29815.

Full text

Abstract:

Computer-assisted language learning (CALL) programs developed earlier for vocabulary acquisition employed mainly word-list pedagogy and could not present information in a real world context. Advancement in computer technology has triggered the development of multimedia CALL programs which can present information in different formats using graphics, sound, text, and video with links to other chunks of information. The purpose of this study was to examine the effects of two multimedia CALL programs on vocabulary acquisition. Participants were 86 intermediate level English as a second language (ESL) students. They were randomly assigned to one of two treatment groups. Students in group one viewed a program with Motion Graphics and text. Students in group two viewed a program that had Still Graphics and text. Their task was to study ten names of hand and power tools. Both groups took the pretest, viewed the video of the tools, had an immediate posttest and a two-week delayed posttest.The results yielded no treatment effects. Further analysis revealed time effects but no interaction between treatment and time. Students who learned through Motion Graphics performed significantly better on the recall tests than those who learned through Still Graphics. Further research in this area involving the use of various graphic formats in a CALL environment is needed.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

37

Ravelo, Jesus N. "Relations, graphs and programs." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Romero, M. B. A. "Graphical creation of structured programs." Thesis, University of Sussex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Wessman, Richard R. "Ada and the graphical kernel system /." Online version of thesis, 1988. http://hdl.handle.net/1850/10624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

De, Blois Serge. "Développement d'une interface d'application de déformations à des objets tridimensionnels dans le domaine de l'infographie." Doctoral thesis, Universite Libre de Bruxelles, 1992. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Deng, Yuwen. "Animated vehicle turning path simulation system on an Internet/Intranet browser." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2091.

Full text

Abstract:

The animated vehicle turning path simulation system on Internet/Intranet web browser presented in this project is intended to provide civil engineers with an easy-to-use, all functional simulation system that could help them with highway and street design.

APA, Harvard, Vancouver, ISO, and other styles

42

Eaton, Anthony John. "Graphical debugging and validation of parallel programs." Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Trivedi, Nihar. "An approach to display layout of dynamic windows." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1997. https://ro.ecu.edu.au/theses/884.

Full text

Abstract:

The development of windows based user interface has introduced a new dimension to the field of human computer interaction. Now a user is able to perform multiple tasks at a time, often switching from one task to another. However windows environment also imposes the burden of manual windows management on the user. Several studies have suggested that manual window management is an unproductive chore often resulting in clutter and confusion on the display screen. Therefore we need a automatic windows layout generator to free the user to perform other useful tasks. This thesis introduces SPORDAC {Shadow Propagation for Overlap Removal and Display Area Compaction) algorithm. This algorithm aims to remove overlap from the display layout and encapsulate the layout in the finite display area. The SPORDAC prototype integrates the SPORDAC algorithm with simulated annealing to optimise the display area usage. The usefulness and applicability of the SPORDAC approach are illustrated with the implementation of a prototype, samples of generated layouts and analysis of the collected data

APA, Harvard, Vancouver, ISO, and other styles

44

Pester, Matthias. "Visualization Tools for 2D and 3D Finite Element Programs - User's Manual." Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600436.

Full text

Abstract:

This paper deals with the visualization of numerical results as a very convenient method to understand and evaluate a solution which has been calculated as a set of millions of numerical values. One of the central research fields of the Chemnitz SFB 393 is the analysis of parallel numerical algorithms for large systems of linear equations arising from differential equations (e.g. in solid and fluid mechanics). Solving large problems on massively parallel computers makes it more and more impossible to store numerical data from the distributed memory of the parallel computer to the disk for later postprocessing. However, the developer of algorithms is interested in an on-line response of his algorithms. Both visual and numerical response of the running program may be evaluated by the user for a decision how to switch or adjust interactively certain parameters that may influence the solution process. The paper gives a survey of current programmer and user interfaces that are used in our various 2D and 3D parallel finite element programs for the visualization of the solution.

APA, Harvard, Vancouver, ISO, and other styles

45

Nall, Aaron J. "An extensible Java system for graph editing and algorithm animation." Virtual Press, 1998. http://liblink.bsu.edu/uhtbin/catkey/1115431.

Full text

Abstract:

The G-Net research group at Ball State University previously developed a graph editor, written in Java, with limited algorithm support. This editor was modified until the code had the instability of a legacy system. It was decided that, rather than continue working with the old system, a new version would be created.The enhancements planned for this new version were more efficient data structures, easy addition of new algorithms, and animated algorithm output. Additionally, the new version was to be written in compliance with the latest Java standards. This paper describes the structure of this new program, Jedit3.1. An overview of the structure of the program and detailed descriptions of the material that future programmers will need to understand in order to add new algorithms is included. Appropriate descriptions are included for files that future programmers should understand but not necessarily modify.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

46

Darbhamulla, Lalitha. "A Java image editor and enhancer." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2705.

Full text

Abstract:

The purpose of this project is to develop a Java Applet that provides all the tools needed for creating image fantasies. It lets the user pick a template and an image, and combine them together. The user can then apply image processing techniques such as rotation, zooming, blurring etc according to his/her requirements.

APA, Harvard, Vancouver, ISO, and other styles

47

Hamilton, Ian J. "A graphic representation scheme and a tool for natural language documentation of C++ programs." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7721.

Full text

Abstract:

A graphic representation scheme to represent C++ programs is presented as a set of related templates. The templates represent the three types of objects in a C++ program and their inheritance properties. A survey of existing C++ tools is presented followed by a brief introduction to the DoC++ (Documentation for C++) tool. The concepts in the C++ language underlying the DoC++ tool are discussed. The two parts of DoC++ are explained in detail. The Organized Representation for C++ (ORC++) tool provides templates for overviews and detailed views of C++ programs. The Natural language for C++ (NlC++) tool supports ORC++ by providing natural language to complement the ORC++ documentation. The implementation of the DoC++ system is discussed. Conclusions and suggestions for further research are made. Examples of the DoC++ output are included.

APA, Harvard, Vancouver, ISO, and other styles

48

Henriksson, Ola. "A Depth of Field Algorithm for Realtime 3D Graphics in OpenGL." Thesis, Linköping University, Department of Science and Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1169.

Full text

Abstract:

The company where this thesis was formulated constructs VR applications for the medical environment. The hardware used is ordinary dektops with consumer level graphics cards and haptic devices. In medicin some operations require microscopes or cameras. In order to simulate these in a virtual reality environment for educational purposes, the effect of depth of field or focus have to be considered.

A working algorithm that generates this optical occurence in realtime, stereo rendered computer graphics is presented in this thesis. The algorithm is implemented in OpenGL and C++ to later be combined with a VR application simulating eye-surgery which is built with OpenGL Optimizer.

Several different approaches are described in this report. The call for realtime stereo rendering (~60 fps) means taking advantage of the graphics hardware to a great extent. In OpenGL this means using the extensions to a specific graphic chip for better performance, in this case the algorithm is implemented for a GeForce3 card.

To increase the speed of the algorithm much of the workload is moved from the CPU to the GPU (Graphics Processing Unit). By re-defining parts of the ordinary OpenGL pipeline via vertex programs, a distance-from-focus map can be stored in the alpha channel of the final image with little time loss.

This can effectively be used to blend a previously blurred version of the scene with a normal render. Different techniques to quickly blur a renderedimage is discussed, to keep the speed up solutions that require moving data from the graphics card is not an option.

APA, Harvard, Vancouver, ISO, and other styles

49

Bakan, Atilla Bas Yavuz. "A design of Computer Aided Instructions (CAI) for undirected graphs in the Discrete Math Tutorial (DMT) /." Monterey, California : Naval Postgraduate School, 2009. http://handle.dtic.mil/100.2/ADA239997.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 1990.
Thesis Advisor(s): Hefner, Kim ; Shing, Mantak. "June 1990." Description based on signature page on October 16, 2009. DTIC Descriptor(s): Computer aided design, computer programs, education, graphs, instructions, limitations, mathematics, military personnel, physical properties, students, theses, United States military academy, United States naval academy DTIC Indicator(s): Computer aided instruction, Computer programs, Graphs, Theses. Author(s) subject terms: Computer aided instructions, tutorial, undirected graphs, Discrete Math Tutorial (DMT). Includes bibliographical references. Also available online.

APA, Harvard, Vancouver, ISO, and other styles

50

Vo-Dinh, Nhieu. "EPSCADD : energy performance simulation using CADD." Thesis, Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/33634.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Computer graphics – Computer programs'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles