نتایج جستجو برای: drawing graphics

تعداد نتایج: 94622  

Journal: :Graphical Models 2016
Felipe Moura de Carvalho Emilio Vital Brazil Ricardo Marroquim Mario Costa Sousa Antonio A. F. Oliveira

In the Oil and Gas industry, processing and visualizing 3D models is of paramount importance for making exploratory and production decisions. Hydrocarbons reservoirs are entities buried deep in the earth’s crust, and a simplified 3D geological model that mimics this environment is generated to run simulations and help understand geological and physical concepts. For the task of visually inspect...

2003
Mikael Klasson

The computational power of PC graphics processors has taken giant leaps forward in recent years. Instead of being simple line-drawing devices, these processors now often prove viable, and in fact superior, alternatives to regular CPUs when it comes to heavy computation.

2001
Ellen Yi-Luen Do

This paper describes the background and research for a diagram sorting and analysis system called GIDA – Graphics Interpreter of Design Actions. The GIDA system explores how spatial relations between graphic symbols in a design drawing may be extracted and the transformations of the graphic elements between different drawings in a design process may be tracked.

2017
Daniel BERIO Réjean PLAMONDON

We present the Sigma Lognormal model as a potential tool for curve generation in computer graphics related applications. We discuss its extension and parameterisations for the interactive definition of handwriting, drawing and calligraphic trajectories. This results in an efficient trajectory synthesis method, that has a user interface similar to the ones commonly used with Bézier curves or spl...

2007
Franz J. Brandenburg

Graph drawing algorithms are generally concerned with abstract graphs. Nodes are displayed as small points and edges as thin lines. Their real expansion on screen is neglected, since it is much smaller than unit distances between objects. In many applications this assumption is not adaequate, for example, when nodes vary much in size and edges have a real width. Then the visualized objects are ...

Journal: :Bioinformatics 2003
Elmar Trost Hubert Hackl Michael Maurer Zlatko Trajanoski

SUMMARY A visual Java-based tool for drawing and annotating biological pathways was developed. This tool integrates the possibilities of charting elements with different attributes (size, color, labels), drawing connections between elements in distinct characteristics (color, structure, width, arrows), as well as adding links to molecular biology databases, promoter sequences, information on th...

2003
Fabian Di Fiore Frank Van Reeth

This paper introduces new techniques and tools to draw, manipulate and animate stylised brush strokes in computer assisted animation production. We focus on eliminating the time-consuming and tedious process of drawing and managing the numerous brushes that are painted on top of each other, and on avoiding temporal aliasing artifacts such as brushes popping up in successive frames. Moreover, we...

Journal: :Displays 2009
Osama Halabi Norishige Chiba

Laser projection, such as that used in laser light shows, usually uses computer-drawn graphics. However, some restrictions are imposed by laser-scanned displays on these vector-based drawings. This paper presents a general vector-oriented drawing method to display computer vector graphics on different laser-scanned displays with optimization. The method considers how to solve the three fundamen...

Journal: :Journal of Visualization and Computer Animation 2015
Ben Jones Jovan Popovic James McCann Wilmot Li Adam W. Bargteil

Traditional methods for creating dynamic objects and characters from static drawings involve careful tweaking of animation curves and/or simulation parameters. Sprite sheets offer a more drawing-centric solution, but they do not encode timing information or the logic that determines how objects should transition between poses and cannot generalize outside the given drawings. We present an appro...

Journal: :IEEE Trans. Parallel Distrib. Syst. 2000
Tiziana Calamoneri Stephan Olariu Rossella Petreschi

ÐThe main contribution of this work is to offer a simple and cost-efficient parallel algorithm that, given an arbitrary n-vertex cubic graph G as input, produces an orthogonal grid drawing of G in O…logn† time, using n processors on an EREW PRAM. Our algorithm matches the time and cost performance of the best previously-known algorithm while at the same time improving the constant factors invol...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید