Issue 3

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/62

Browse

Now showing 1 - 20 of 44

3D Visualization for 2D GIS: an Analysis of the Users Needs and a Review of Techniques*
(Blackwell Science Ltd and the Eurographics Association, 1994) Giertsen, Christopher; Lucas, Anne
Most of the existing geographical information systems (GIS) make limited use of algorithms for advanced computer graphics and visualization. One explanation is that few attempts are made to identify the visualization needs for different uses of GIS, and to couple such needs to the available algorithms. Another explanation is that most GIS are designed to handle two-dimensional (20) data with few obvious relationships to three-dimensional (30) visualization.In an attempt to provide a better understanding of the application of visualization in GIS, we propose a conceptual framework linking several aspects of the two fields. At the user-level, we link different uses of GIS to different categories of audience and presentation styles. At the level of implementation, we first propose different ways to create 3D data for visualization from 2D GIS data, and then we review algorithms and techniques for 3D visualization with respect to support of different presentation styles.
Adaptive mesh generation for progressive radiosity: A ray-tracing based algorithm.
(Blackwell Science Ltd and the Eurographics Association, 1994) PAULIN, Mathias; JESSEL, Jean-Pierre
The radiosity method is one of the most popular rendering algorithms. It allows to simulate interreflections of light accurately between surfaces as energy transfers are well designed. However, this algorithm and its derivatives need to break scenes into a relatively large number of small elements to approximate the illumination function. Even with a very large number of elements, not all the illumination effects can be simulated. In fact, there are always artefacts when modelling sharp shadows, besides shadows falling between mesh vertices can be missed entirely. To reduce the computational cost of such methods and to increase the accuracy of the radiosity solution, adaptive mesh generation is well suited. In this paper, we present a ray-tracing based algorithm for adaptive mesh generation which resolves all the illumination problems without lengthening computation time too much. This method allows a small number of initial elements and increases element density in critical locations while solving the illumination problem.
AGRELs and BIPs: Metamorphosis as a Bezier curve in the space of polyhedra
(Blackwell Science Ltd and the Eurographics Association, 1994) Rossignac, Jarek; Kaul, Anil
The metamorphosis between two user-specified objects offers an intuitive metaphor for designing animations of deforming shapes. We present a new technique for interactively editing such deformations and for animating them in realtime. Besides the starting and ending shapes, our approach offers easy to use additional control over the deformations. The new Bezier Interpolating Polyhedron (BIP) provides a graphics representation of such a deforming object formulated mathematically as a point describing a Bezier curve in the space of all polyhedra. We replace, in the Bezier formulation, the traditional control points by arbitrary polyhedra and the vector addition by the Minkowski sum. BIPs are composed of Animated GRaphic ELement (AGRELs), which are faces with constant orientation, but with parametrized vertices represented by Bezier curves. AGRELs were designed to efficiently support smooth realtime animation on commercially available rendering hardware. We provide a tested algorithm for automatically computing BIPs from the sequence of control polyhedra and demonstrate its applications to animation design.
Beyond WYSIWYG: Display of Hidden Information in Graphics Editors
(Blackwell Science Ltd and the Eurographics Association, 1994) Schleich, R.; Durst, M.J.
Graphics editors such as computer aided design systems are complex and difficult to use. We attribute this to the fact that only a small part of the information is visible and therefore accessible and understandable. Only the graphics objects themselves are visible, but the relations between these objects remain hidden. We propose an effective way to visualise this information in the form of trees and graphs in so-called structure browsers. A prototype implements this proposal based on an object-oriented application framework for graphics editors.
Chebyshev Polynomials for Boxing and Intersections of Parametric Curves and Surfaces
(Blackwell Science Ltd and the Eurographics Association, 1994) Fournier, Alain; Buchanan, John
Parametric curves and surfaces are powerful and popular modelling tools in Computer Graphics and Computer Aided Design. Ray-tracing is a versatile and popular rendering technique. There is therefore a strong incentive in developing fast, accurate and reliable algorithms to intersect rays and parametric curves and surfaces.We propose and demonstrate the use of Chebyshev basis functions to speed up the computation of the intersections between rays and parametric curves or surfaces. The properties of Chebyshev polynomials result in the computation of better and tighter enclosing boxes. For surfaces they provide a better termination criterion to decide on the limits of subdivision, and allow the use of bilinear surfaces for the computation of the intersection when needed.The efficiency of the techniques used depends on the relative magnitude of the coefficients of the Chebyshev basis functions. We show from a statistical analysis of the characteristics of several thousands surfaces of different origin that these techniques will result most of the time in significant improvement in speed and accuracy over other other boxing and subdivision techniques.
COMPUTER GRAPHICS AND REMOTE SENSING - A SYNTHESIS FOR ENVIRONMENTAL PLANNING AND CIVIL ENGINEERING
(Blackwell Science Ltd and the Eurographics Association, 1994) Graf, K.Ch.; Suter, M.; Hagger, J.; Nuesch, D.
This paper presents efforts undertaken in the field of photo-realistic visualization of natural landscapes using digital elevation models (DEM) and images generated by remote sensing techniques. The remote sensing systems used in this work include Landsat Thematic Mapper, SPOT HRV and aerial photographs. After an appropriate preprocessing, including radiometric corrections and image enhancement procedures, a precise geometric correction is performed in order to achieve a very high co-registration of the images with the elevation model. A mosaic of several images at various resolutions is stored together with the DEM in a data set covering an extensive area. These data are then input to an efficient hardware-independent terrain rendering algorithm based on a forward projection. Atmospheric effects can be simulated. The concept of a virtual scene allows an automated embedding of raytraced 3D objects. The results show that these methods can be used in the field of environmental planning, civil engineering and other applications where terrain visualization is required.
Computer Graphics System for Reproducing Three- Dimensional Shape from Idea Sketch
(Blackwell Science Ltd and the Eurographics Association, 1994) Akeo, Makoto; Hashimoto, Hiroshi; Kobayashi, Taisuke; Shibusawa, Tetsuo
This paper describes the technical features and method of implementation of our designer support system which enables reproducing a three-dimensional shape from an idea sketch speedily and modifying the reproduced shape easily, thereby facilitating the consistency of the shape to be checked from a design viewpoint.The designer support system was developed as a tool to cut the time and labor designers have to spend in the design process and help designers to fully display their creativity-the essential attribute of designers.This system uses cross-section lines of an idea sketch of an object drawn by an industrial designer as input data to reproduce automatically a three-dimensional wireframe model of the object by a newly developed three-dimensional graphic algorithm including graphic constraints. In addition, it automatically creates planes by scanning the area enclosed by reproduced curved lines and subjects them to shading. In this process, the dimensions of the object need not be input to the system. The designer can operate the system simply by using the mouse to input appropriate data.Thus, the system permits the designer to easily express his idea in the form of a three-dimensional shape and study idea variations on the display screen without creating a mockup.
Cross Scan Buffer and its Applications
(Blackwell Science Ltd and the Eurographics Association, 1994) Tanaka, Toshimitsu; Takahashi, Tokiichiro
We propose the Cross Scanline Buffer which preserves the result of hidden surface removal as performed by the Cross Scanline Algorithm. The Cross Scan Buffer reduces image re-generation time and eliminates aliasing artifacts even if the image is arbitrarily scaled. Perfect anti-aliasing is achieved because the Cross Scanline Algorithm analytically determines visible polygonal surfaces and divides them into sets of triangles and trapezia. The Cross Scan Buffer supports the various applications that currently use the conventional buffering methods for anti-aliasing. This paper introduces and tests three applications: image scaling, shadow creation, and texture mapping. Experimental results verify that the Cross Scan Buffer is very powerful yet efficient.
Designing and Implementing a Grid-Distortion Mapping Based on Variational Principles
(Blackwell Science Ltd and the Eurographics Association, 1994) Arad, Nur
A grid-distortion mapping based on variational principles is described. The mapping is first defined between any two equivalent regular grids with minor geometric restrictions, and is then optimally extended to the interior of the source grid in a sense to be defined. The result is independent of the particular representation of the curves, and depends only on geometric properties of the grids. We then proceed to construct an approximation to the mapping defined and demonstrate its implementation. Finally, this algorithm is compared to several competing ones, in particular separable (scanline) algorithms.
Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity
(Blackwell Science Ltd and the Eurographics Association, 1994) VOLINO, Pascal; THALMANN, Nadia Magnenat
We present a new algorithm for detecting self-collisionson highly discretized moving polygonal surfaces. If is based on geometrical shape regularity properties that permit avoiding many useless collision tests. We use an improved hierarchical representation of our surface that, besides the optimizations inherent to hierarchisation, allows us to fake adjacency information to our advantage for applying efficiently our geometrical optimizations. We reduce the computation time between each frame by building automatically the hierarchical structure once as a preprocessing task. We describe the main principles of our algorithm, followed by some performance tests.
Fast Dynamic Tessellation of Trimmed NURBS Surfaced1
(Blackwell Science Ltd and the Eurographics Association, 1994) Abi-Ezzi, Salim S.; Subramaniam, Srikanth
Trimmed NURBS (non-uniform rational B-splines) surfaces are being increasingly used and standardized in geometric modeling applications. Fast graphical processing of trimmed NURBS at interactive speeds is absolutely essential to enable these applications. which poses some unique challenges in software, hardware, and algorithm design. This paper presents a technique that uses graphical compilation to enable fast dynamic tessellation of trimmed NURBS surfaces under highly varying transforms.We use the concept of graphical data compilation. through which we preprocess the NURBS surface into a compact, view-independent form amenable for fast per-frame extraction of triangles. Much of the complexity of processing is absorbed during compilation. Arbitrarily complex trimming regions are broken down into simple regions that are specially designed to facilitate tessellation before rendering. Potentially troublesome cases of degeneracies in the surface are detected and dealt with during compilation. Compilation enables a clean separation of algorithm-intensive and compute-intensive operations, and provides for parallel implementations of the latter. Also, we exercise a classification technique while processing trimming loops. which robustly takes care of geometric ambiguities and deals with special cases while keeping the compilation code simple and concise.
Fast Wavelet Radiosity Method
(Blackwell Science Ltd and the Eurographics Association, 1994) Pattanaik, Sumanta N.; Bouatouch, Kadi
Wavelet analysis has been found [1] to be very useful for functional representation and accurate global solution of radiosity. In radiosity we deal with functions in 2D and 4D spaces. Under such conditions, the biggest bottleneck in applying this wavelet analysis seems to be the large number of multidimensional inner products. In this paper, we propose (i) the use of interpolating wavelets for fast inner product computation and consequently for faster wavelet radiosity solution (ii) the use of hierarchical decomposition technique for determining the smoothness of the radiosity function for optimal adaptive subdivision.
A Formal Approach to the Specification of Graphic Object Functions
(Blackwell Science Ltd and the Eurographics Association, 1994) Torres, J.C.; Clares, B.
Graphic objects are an abstract mathematical model for graphic systems. The model is an algebraic approach to represent graphic information, which include modelling operations. This formalism require some method to describe normal graphic procedures, such as changing the object colour or texture mapping, as these procedures are essential to represent graphic processes.This paper extends the theory by introducing the concept of graphic object functions. A graphic object function transforms one graphic object into another, changing its visual appearance or its geometric properties. A formal definition of graphic functions is given, with a characterization of two special kinds of graphic object functions: filters and object transference functions. These two kinds of functions can be used to perform normal graphic operations, such as changing colours, texture mapping or clipping.Equivalence relationships between graphic objects induced by functions are also studied. These relationships establish an hierarchical structure on the graphic object set.
GKS-9x: The Design Output Primitive, an Approach to a Specification.
(Blackwell Science Ltd and the Eurographics Association, 1994) Nehlig, Ph. W.; Duce, D. A.
This paper describes an approach to the formal definition of the design primitive introduced in the revision of the ISO/IEC computer graphics standard, GKS. The paper starts with a general description of the design primitive and then describes the specification (which is given in the Z notation) and the motivation for the approach taken in some detail. The paper concludes with a reflection on the contribution of this work, and the descriptive style adopted an the GKS revision, to the role of formal description in the presentation of graphics standards.
A Hand Control and Automatic Grasping System for Synthetic Actors
(Blackwell Science Ltd and the Eurographics Association, 1994) Sanso, Ramon Mas; Thalmann, Daniel
In the computer animation field, the interest for grasping has appeared with the development of synthetic actors. Based on a grasp taxonomy, we propose a completely automatic grasping system for synthetic actors. In particular, the system can decide to use a pinch when the object is too small to be grasped by more than two fingers or to use a two-handed grasp when the object is too large. The system also offers both direct and inverse kinematics to control the articulations. In order to ensure realistic looking closing of the hand, several of the joints are constrained. A brief description of the system and results are also presented.
How to Render Frames and Influence People
(Blackwell Science Ltd and the Eurographics Association, 1994) Strothotte, Thomas; Preim, Bernhard; Raab, Andreas; Schumann, Jutta; Forsey, David R.
Rendering systems generally treat the production of images as an objective process governed by the laws of physics. However, perception and understanding on the part of viewers are subjective processes influenced by a variety offactors. For example, in the presentation of architectural drawings, the apparent precision with which the drawings are made will affect whether the viewer considers the design as part of a preliminary design or as part of a final polished project, and to some extent the level of confidence the viewer has in the encoded information.In this paper we develop techniques for rendering images in a way that differs from the usual photorealistic or wire-frame output of renderers. In particular, our techniques allow a user to adjust the rendering of a scene to produce images using primitives with variable degrees of precision, from approximations that resemble vague"five-minute-sketches" to more mature but still hand-drawn images. We provide a theoretical framework for analysing the information flow from the computer to the user via such images. Finally, we describe the design and implementation of a prototypical renderer and show examples of its output.
Implementing RenderMan - Practice, Problems and Enhancements
(Blackwell Science Ltd and the Eurographics Association, 1994) Slusallek, Philipp; Pflaum, Thomas; Seidel, Hans-Peter
The RenderMan interface has been proposed as a general interface to rendering systems, yet only a few implementations of the interface exist. In this paper we describe the implementation of the RenderMan interface on a general rendering architecture that supports various rendering algorithms. Specifically we discuss the implementation of the RenderMan Shading Language and its integration into our rendering architecture. Special attention is focused on the problems that we have encountered and how they can be solved. Additionally, we suggest extensions and enhancements to the current interface definition, which would make RenderMan easier to implement and more flexible to use.
Improved Visualisation of Marine Data: Algae and Acid Rain
(Blackwell Science Ltd and the Eurographics Association, 1994) Day, A.M.; Turner, S.M.; Arnold, D.B.
An Inexpensive BRDF Model for Physically-based Rendering
(Blackwell Science Ltd and the Eurographics Association, 1994) Schlick, Christophe
A new BRDF model is presented which can be viewed as an kind of intermediary model between empirism and theory. Main results of physics are observed (energy conservation, reciprocity rule, microfacet theory) and numerous phenomena involved in light reflection are accounted for, in a physically plausible way (incoherent and coherent reflection, spectrum modifications, anisotropy, self-shadowing, multiple surface and subsurface reflection, differences between homogeneous and heterogeneous materials). The model has been especially intended for computer graphics applications and therefore includes two main features: simplicity (a small number of intuitively understandable parameters controls the model) and efficiency (the formulation provides adequation to Monte-Carlo rendering techniques and/or hardware implementations).
An Integrated Line Tracking and Vectorization Algorithm
(Blackwell Science Ltd and the Eurographics Association, 1994) van Nieuwenhuizen, Peter R.; Kiewiet, Olaf; Bronsvoort, Willem F.
A method is presented to compute a vector representation of an arbitrary line in a bi-level raster image The line may have varying line width and irregular borders. Furthermore, at line crossings and branches the user is offered the opportunity to choose from the directions in which line tracking may he continued The method avoids thinning and vectorization of chain codes. Instead, a contour follower is used at both sides of the line, and median line calculation is integrated with contour following. This leads to an efficient algorithm, in particular when individual lines have to be interactively extracted from a raster image.

Browse

Browsing Issue 3 by Title

Results Per Page

Sort Options