Issue 3

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 41

Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Comba, Joao; Klosowsk, James T.; Max, Nelson; Mitchell, Joseph S. B.; Silva, Claudio T.; Williams, Peter L.
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing the cell's color and opacity into the final image. Crucial to this method is the computation of a visibility ordering of the cells. If the mesh is "well-behaved" (acyclic and convex), then the MPVO method of Williams provides a very fast sorting algorithm; however, this method only computes an approximate ordering in general datasets, resulting in visual artifacts when rendered. A recent method of Silva et al. removed the assumption that the mesh is convex, by means of a sweep algorithm used in conjunction with the MPVO method; their algorithm is substantially faster than previous exact methods for general meshes.In this paper we propose a new technique, which we call BSP-XMPVO, which is based on a fast and simple way of using binary space partitions on the boundary elements of the mesh to augment the ordering produced by MPVO. Our results are shown to be orders of magnitude better than previous exact methods of sorting cells.
A Free Form Feature Taxonomy
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Fontana, M.; Giannini, F.; Meirana, M.
In this paper the notion of free form feature for aesthetic design is presented. The design of industrial products constituted by free form surfaces is done by using CAD systems representing curves and surfaces by means of NURBS functions, which are usually defined by low level entities that are not intuitive and require some knowledge of the mathematical language. Similarly to the feature-based approach adopted by CAD systems for classical mechanical design, a set of high level modelling entities which provides commonly performed shape modifications has been identified. Particularly, the paper suggests a classification of the so-called detail features for an aesthetic and/or functional characterization of predefined free form surfaces. Feature types are formally described by means of an analytical definition of the surface modification through deformation and elimination laws. A topological classification is then given according to the application domain of such laws. A further sub-classification of morphological types is then suggested according to geometric properties of weak convexity and concavity for the resulting modified shape, leading to a taxonomy of simple free form features meaningful for aesthetic design.
An Efficient and Flexible Perception Pipeline for Autonomous Agents
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Bordeux, Christophe; Boulic, Ronan; Thalmann, Daniel
Agents in virtual environments require a combination of perception and action to behave in an autonomous way. We extend a software architecture for the management of actions blending, called AGENTlib, with a perception mechanism. The perception system provides a uniform interface to various techniques in the field of virtual perception, including synthetic vision, database access and perception persistency. We describe the framework we designed to efficiently filter valuable information from the scene and we address concerns about computation redundancy and data propagation through multiple filtering modules.
An Informed Environment Dedicated to the Simulation of Virtual Humans in Urban Context
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Farenc, Nathalie; Boulic, Ronan; Thalmann, Daniel
In this paper, we outline the creation of an Informed Environment, dedicated to urban life simulation.We propose methods and tools for creating and providing the information necessary for animating virtual humans in a city using an Informed Environment. The Informed Environment is based on a hierarchical decomposition of a urban scene into Environment Entities providing geometrical information as well as semantic notions, thus allowing a more realistic simulation of human behaviour. In this manner, virtual humans can integrate with a certain kind of urban knowledge.
Stochastic Iteration for Non-diffuse Global Illumination
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Szirmay-Kalos, Laszlo
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly in each iteration. The requirements of convergence are given for the general case. To demonstrate the basic idea, a very simple,continuous random transport operator is examined, which gives back the light tracing algorithm incorporating Russian roulette. Then, a new mixed continuous and finite-element based iteration method is proposed, which uses ray-bundles to transfer the radiance in a single random direction. The resulting algorithm is fast, it provides initial results in seconds and accurate solutions in minutes and does not suffer from the error accumulation problem and the high memory demand of other finite-element and hierarchical approaches.
Virtual Dunhuang Art Cave: A Cave within a CAVE
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Lutz, B.; Weintke, M.
Virtual Reality can present historical places in a three-dimensional and interactive way, giving visitors a photorealistic impression of objects. Not only existing scenarios can be shown, but VR can also be used to rebuild scenarios that were damaged or destroyed a long time ago, giving new life to the cultural heritage. We used Virtual Reality to present the Mogao Grottos in Dunhuang. This cave site is one of the most important cultural and religious places by the ancient Silk Road. The presentation is to give visitors the impression of visiting the cave site and provide information about the caves, paintings and statues in an interesting way. To achieve this, we developed a new, intuitive interaction paradigm, which enables the user to explore the caves. To give observers a photorealistic impression of the caves and to create a feeling of immersion, innovative rendering techniques were integrated.The resulting presentation combines Virtual Reality and archaeology to give tourists a realistic experience of this cave site and to support scientists in their research work.
Improved Laplacian Smoothing of Noisy Surface Meshes
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Vollmer, J.; Mencl, R.; Muller, H.
This paper presents a technique for smoothing polygonal surface meshes that avoids the well-known problem of deformation and shrinkage caused by many smoothing methods, like e.g. the Laplacian algorithm. The basic idea is to push the vertices of the smoothed mesh back towards their previous locations. This technique can be also used in order to smooth unstructured point sets, by reconstructing a surface mesh to which the smoothing technique is applied. The key observation is that a surface mesh which is not necessarily topologically correct, but which can efficiently be reconstructed, is sufficient for that purpose.
Texturing 3D Models of Real World Objects from Multiple Unregistered Photographic Views
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Neugebauer, Peter J.; Klein, Konrad
As the efficiency of computer graphic rendering methods is increasing, generating realistic models is now becoming a limiting factor. In this paper we present a new technique to enhance already existing geometry models of real world objects with textures reconstructed from a sparse set of unregistered still photographs. The aim of the proposed technique is the generation of nearly photo-realistic models of arbitrarily shaped objects with minimal effort. In our approach, we require neither a prior calibration of the camera nor a high precision of the user's interaction. Two main problems have to be addressed of which the first is the recovery of the unknown positions and parameters of the camera. An initial estimate of the orientation is calculated from interactively selected point correspondences. Subsequently, the unknown parameters are accurately calculated by minimising a blend of objective functions in a 3D-2D projective registration approach. The key point of the proposed method of registration is a novel filtering approach which utilises the spatial information provided by the geometry model. Second, the individual images have to be combined yielding a set of consistent texture maps. We present a robust method to recover the texture from the photographs thereby preserving high spatial frequencies and eliminating artifacts, particularly specular highlights. Parts of the object not seen in any of the photographs are interpolated in the textured model. Results are shown for three complex example objects with different materials and numerous self-occlusions.
Seamless Integration of Databases in VR for Constructing Virtual Environments
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Soetebier, Ingo; Dorner, Ralf; Braun, Norbert
An approach for authoring virtual environments within the virtual environments themselves is presented, integrating a database containing arbitrary components that are used to construct the 3D scene. The issues important to a seamless integration of the database, such as multimedia data storage and database linkage are discussed, with the focus on the human-computer interaction component. A concept for a 3D database interface is described for query, presentation and usage of query results in the virtual environment. Finally, an implementation of the concept using VRML and Java is presented.
Generalized View-Dependent Simplification
(Blackwell Publishers Ltd and the Eurographics Association, 1999) El-Sana, Jihad; Varshney, Amitabh
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detail-based renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view-dependence tree in an implicit fashion. We have observed that this not only reduces the space requirements by a factor of two, it also highly localizes the memory accesses at run time. The view-dependence tree is used at run time to generate the triangles for display. We also propose a cubic-spline-based distance metric that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity (Supplementary material)
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Hasenfratz, Jean-Marc; Damez, Cyrille; Sillion, Francois; Drettakis, George
Multi-layered impostors for accelerated rendering
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Decoret, Xavier; Sillion, Francois; Schaufler, Gernot; Dorsey, Julie
This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environments. We introduce a new type of impostor, which has the desirable property of limiting de-occlusion errors to a user-specified amount. This impostor, composed of multiple layers of textured meshes, replaces the distant geometry and is much faster to draw. It captures the relevant depth complexity in the model without resorting to a complete sampling of the scene. We show that layers can be dynamically updated during visualization. This guarantees bounded scene complexity in each frame and also exploits temporal coherence to improve image quality when possible. We demonstrate the strengths of this approach in the context of city walkthroughs.
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Hasenfratz, Jean-Marc; Damez, Cyrille; Sillion, Francois; Drettakis, George
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an elegant theoretical solution by reducing the asymptotic complexity of the algorithm, its practical use raises many difficulties, and may result in image artifacts or unexpected behavior. This paper proposes a detailed analysis of the expectations placed on clustering and compares the relative merits of existing, as well as newly introduced, clustering algorithms. This comparison starts from the precise definition of various clustering strategies based on a taxonomy of data structures and construction algorithms, and proceeds to an experimental study of the clustering behavior for real-world scenes. Interestingly, we observe that for some scenes light is difficult to simulate even with clustering. Our results lead to a series of observations characterizing the adequacy of clustering methods for meeting such diverse goals as progressive solution improvement, efficient ray casting acceleration, and faithful representation of object density for approximate visibility calculations.
Partitioning and Handling Massive Models for Interactive Collision Detection
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Wilson, A.; Larsen, E.; Manocha, D.; Lin, M. C.
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to interactive data access and processing in a large geometric database, which may not fit into main memory of typical desktop workstations or computers. We present a new algorithm using overlap graphs for localizing the "regions of interest" within a massive model, thereby reducing runtime memory requirements. The overlap graph is computed off-line, pre-processed using graph partitioning algorithms, and modified on the fly as needed. At run time, we traverse localized sub-graphs to check the corresponding geometry for proximity and pre-fetch geometry and auxiliary data structures. To perform interactive proximity queries, we use bounding-volume hierarchies and take advantage of spatial and temporal coherence. Based on the proposed algorithms, we have developed a system called IMMPACT and used it for interaction with a CAD model of a power plant consisting of over 15 million triangles. We are able to perform a number of proximity queries in real-time on such a model. In terms of model complexity and application to large models, we have improved the performance of interactive collision detection and proximity computation algorithms by an order of magnitude.
Active Storytelling
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Glassner, Andrew
Capturing and Re-Using Rendition Styles for Non-Photorealistic Rendering
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Hamel, J.; Strothotte, T.
Rendering high-quality non-photorealistic images of a given geometric model is often associated with a considerable amount of effort on the part of a user to fine-tune the rendition. In this paper we introduce a method and tools for re-using the user's effort invested in one model for the rendering of other models.Our method uses templates to describe rendition styles. The paper gives a number of examples of the successful transfer of styles from one model to another.
The Digital Michelangelo Project
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Levoy, Marc A.
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Kobbelt, Leif P.; Vorsatz, Jens; Labsik, Ulf and
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms in the context of multiresolution representation and modeling can be performed much more efficiently and robustly if the underlying surface tesselations have the special subdivision connectivity. In this paper, we propose a new algorithm for converting a given unstructured triangle mesh into one having subdivision connectivity. The basic idea is to simulate the shrink wrapping process by adapting the deformable surface technique known from image processing. The resulting algorithm generates subdivision connectivity meshes whose base meshes only have a very small number of triangles. The iterative optimization process that distributes the mesh vertices over the given surface geometry guarantees low local distortion of the triangular faces. We show several examples and applications including the progressive transmission of subdivision surfaces.
Interactive Line Art Rendering of Freeform Surfaces
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Elber, Gershon
In recent years, synthetically created line art renderings have reached quality levels that are aesthetically pleasing. Moreover, the sketch based approach was found to be quite capable at conveying geometrical information in an intuitive manner. While a growing interest in this type of rendering method has yielded successful and appealing results, the developed techniques were, for the most part, too slow to be embedded in real time interactive display. This paper presents a line art rendering method for freeform polynomial and rational surfaces that is capable of achieving real time and interactive display. A careful preprocessing stage that combines an a-priori construction of line art strokes with proper classification of these strokes, allows one to significantly alleviate the computational cost, in real time, of the sketch based rendering, and enables interactive line art display.
An Information Theory Framework for the Analysis of Scene Complexity
(Blackwell Publishers Ltd and the Eurographics Association, 1999) Feixas, Miquel; Del Acebo, Esteve; Bekaert, Philippe; Sbert, Mateu
In this paper we present a new framework for the analysis of scene visibility and radiosity complexity. We introduce a number of complexity measures from information theory quantifying how difficult it is to compute with accuracy the visibility and radiosity in a scene. We define the continuous mutual information as a complexity measure of a scene, independent of whatever discretisation, and discrete mutual information as the complexity of a discretised scene. Mutual information can be understood as the degree of correlation or dependence between all the points or patches of a scene. Thus, low complexity corresponds to low correlation and vice versa. Experiments illustrating that the best mesh of a given scene among a number of alternatives corresponds to the one with the highest discrete mutual information, indicate the feasibility of the approach. Unlike continuous mutual information, which is very cheap to compute, the computation of discrete mutual information can however be quite demanding. We will develop cheap complexity measure estimates and derive practical algorithms from this framework in future work.

Browse

Browsing Issue 3 by Issue Date

Results Per Page

Sort Options