scispace - formally typeset
Search or ask a question
Topic

Graphics

About: Graphics is a research topic. Over the lifetime, 17394 publications have been published within this topic receiving 411468 citations. The topic is also known as: graphic.


Papers
More filters
Patent
30 May 1997
TL;DR: In this article, a state controller is configured to store and resend selected primitive data to the geometry accelerators based upon whether one or more vertices of a graphics primitive are contained in more than one of the chunks of primitive data.
Abstract: A computer graphics system for rendering graphics primitives based upon primitive data received from a host computer through a graphics interface includes a plurality of geometry accelerators. A distributor divides the primitive data into chunks of primitive data and distributes the chunks to a current geometry accelerator recipient. A state controller is configured to store and resend selected primitive data to the geometry accelerators based upon whether one or more vertices of a graphics primitive are contained in more than one of the chunks of primitive data. Advantageously, this enables the computer graphics system to efficiently process primitive data while avoiding providing the geometry accelerators with an excessive amount of data than necessary for them to render the primitives. Specifically, the state controller includes in the selected primitive data vertex states which were sent to a previous current geometry accelerator recipient and which are required by the current geometry accelerator recipient to assemble at least a portion of the graphics primitive. In addition, the state controller resends the property states to the current geometry accelerator recipient when the currently-stored local state in the current geometry accelerator recipient is not the same as a currently-effective local state. Furthermore, when the resent vertex states include a first and second resent vertex state, the selected primitive data includes property states which changed from when the first vertex state was sent to the previous current geometry accelerator and the second vertex state was sent to the previous current geometry accelerator.

101 citations

Patent
18 Mar 2010
TL;DR: In this paper, a method to represent graphical images upon a transparent windscreen head-up display of a vehicle describing an operational environment for the vehicle is presented, where the desired graphic in the viewing space is transformed into a projected graphic in a projection space defined by the surface of the windscreen.
Abstract: A method to represent graphical images upon a transparent windscreen head up display of a vehicle describing an operational environment for the vehicle includes monitoring data describing critical information in the operational environment for the vehicle, monitoring a location of a viewpoint of an operator of the vehicle, determining a desired graphic to represent the critical information in a viewing space based upon the data and the viewpoint, transforming the desired graphic in the viewing space into a projected graphic in a projection space defined by the surface of the windscreen, transforming the projected graphic in the projection space into patterns of projected light in a projector space, and generating commands to a graphics projection system based upon the patterns of projected light.

101 citations

Journal ArticleDOI
TL;DR: A SIMD algorithm is presented that performs the convolution-based DWT completely on a GPU, which brings us significant performance gain on a normal PC without extra cost.
Abstract: Discrete wavelet transform (DWT) has been heavily studied and developed in various scientific and engineering fields. Its multiresolution and locality nature facilitates applications requiring progressiveness and capturing high-frequency details. However, when dealing with enormous data volume, its performance may drastically reduce. On the other hand, with the recent advances in consumer-level graphics hardware, personal computers nowadays usually equip with a graphics processing unit (GPU) based graphics accelerator which offers SIMD-based parallel processing power. This paper presents a SIMD algorithm that performs the convolution-based DWT completely on a GPU, which brings us significant performance gain on a normal PC without extra cost. Although the forward and inverse wavelet transforms are mathematically different, the proposed algorithm unifies them to an almost identical process that can be efficiently implemented on GPU. Different wavelet kernels and boundary extension schemes can be easily incorporated by simply modifying input parameters. To demonstrate its applicability and performance, we apply it to wavelet-based geometric design, stylized image processing, texture-illuminance decoupling, and JPEG2000 image encoding

101 citations

Journal ArticleDOI
TL;DR: A parallel algorithm designed for polygon scan conversion and rendering is presented which supports fast rendering of highly complex data sets using advanced lighting models and an in-depth analysis of the overhead costs accompanying parallel processing shows where performance is adequate or could be improved.
Abstract: Using parallel processing for visualization speeds up computer graphics rendering of complex data sets. A parallel algorithm designed for polygon scan conversion and rendering is presented which supports fast rendering of highly complex data sets using advanced lighting models. Dedicated graphics rendering engines do not necessarily suit such data sets, although they can support real-time update of moderately complex scenes using simple lighting. Advantages to using a software-based approach include the feasibility of adding special rendering features to the program and the capability of integrating a parallel scientific application with a parallel graphics renderer. A new work decomposition strategy presented, called task adaptive, is based on dynamically partitioning the amount of computational work left at a given time. The algorithm uses a heuristic for dynamic task decomposition in which image space tasks are partitioned without requiring interruption of the partitioned processor. A sophisticated memory referencing strategy lets local memory access graphics data during rendering. This permits implementation of the algorithm on a distributed memory multiprocessor. An in-depth analysis of the overhead costs accompanying parallel processing shows where performance is adequate or could be improved. >

101 citations

Patent
31 May 1990
TL;DR: In this paper, a computer is provided with the facility to display in map form spatially-time-varying data associated with respective nodes, and the user is also provided with a tool so that he/she may either manually or automatically play through the data.
Abstract: A computer is provided with the facility to display in map form spatially-time-varying data associated with respective nodes. Specifically, responsive to a user inputting a specific command, the computer displays a plurality of symbols representing respective ones of the nodes in which the symbols share a common characteristic, the size of which is varied commensurate with changes in the data associated with their respective nodes. In addition, the user is provided with a tool so that he/she may either manually or automatically play through the data. The user is also provided with a number of other tools to control the display of the symbols and/or data, such as, for example, a tool which changes the size of the symbols so that smaller symbols are not obscured by larger symbols.

100 citations


Network Information
Related Topics (5)
Software
130.5K papers, 2M citations
86% related
User interface
85.4K papers, 1.7M citations
86% related
Image processing
229.9K papers, 3.5M citations
80% related
Robustness (computer science)
94.7K papers, 1.6M citations
80% related
Feature (computer vision)
128.2K papers, 1.7M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023469
20221,141
2021208
2020349
2019355
2018399