Issue 3

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 53

The Impulse Graph: A New Dynamic Structure For Global Collisions
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Baciu, George; Keung Wong, Sai
In interactive virtual environments and dynamic simulations, collisions between complex objects and articulated bodies may occur simultaneously at multiple points or regions of interference. Many solutions to the collision response problem are formulated based on the local pair-wise contact dynamics. In this article, we present a new solution to the global interactions and dynamic response between multiple structures in a three-dimensional environment. This is based on a new dynamic impulse graph that tracks the reaction forces through the entire system and gives a global view of all the interactions in a multibody system.
Haptic Cues for Image Disambiguation
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Faconti, G.; Massink, M.; Bordegoni, M.; De Angelis, F.; Booth, S.
Haptic interfaces represent a revolution in human computer interface technology since they make it possible for users to touch and manipulate virtual objects. In this work we describe a cross-model interaction experiment to study the effect of adding haptic cues to visual cues when vision is not enough to disambiguate the images. We relate the results to those obtained in experimental psychology as well as to more recent studies on the subject.
Context-based Space Filling Curves
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Dafner, Revital; Cohen-Or, Daniel; Matias, Yossi
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the Peano-Hilbert space filling curve. An efficient algorithm for computing context-based space filling curves is presented. We also discuss the potential of improved autocorrelation of context-based space filling curves for image and video lossless compression.
A Vector-based Representation for Image Warping
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Froumentin, Max; Labrosse, Frederic; Willis, Philip
A method for image analysis, representation and re-synthesis is introduced. Unlike other schemes it is not pixel based but rather represents a picture as vector data, from which an altered version of the original image can be rendered. Representing an image as vector data allows performing operations such as zooming, retouching or colourising, avoiding common problems associated with pixel image manipulation. This paper brings together methods from the areas of computer vision, image compositing and image based rendering to prove that this type of image representation is a step towards accurate and efficient image manipulation.
Binding Virtual Environments to Toolkit Capabilities
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Smith, Shamus P.; Duke, David J.
There are many toolkits and development environments that aid the process of constructing virtual environment applications. Many of these development environments encourage customising a virtual environment's design while rapid prototyping within the confines of a toolkit's capabilities. Thus the choice of the technology and its associated support has been made independent of the end-use requirements of the final system. This can bias a virtual environment's design by implementation based constraints. We propose that an alternative approach is the consideration of virtual environment requirements in the context of an inspectable design model, to identify the requirements that a toolkit will need to support. In the context of an example, we present a selection of design requirements that we consider important for virtual environment design in general. We explore how these requirements might be mapped to different capabilities using Virtual Reality Modelling Language (VRML) as a concrete example of a platform technology.
External Memory View-Dependent Simplification
(Blackwell Publishers Ltd and the Eurographics Association, 2000) El-Sana, Jihad; Chiang, Yi-Jen
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the resulting view-dependence trees to build the meta-node trees, which can facilitate the run-time level-of-detail rendering and is kept in disk. During run-time navigation, we keep in main memory only the portions of the meta-node trees that are necessary to render the current level of details, plus some prefetched portions that are likely to be needed in the near future. The prefetching prediction takes advantage of the nature of the run-time traversal of the meta-node trees, and is both simple and accurate. We also employ the implicit dependencies for preventing incorrect foldovers, as well as main-memory buffer management and parallel processes scheme to separate the disk accesses from the navigation operations, all in an integrated manner. The experiments show that our approach scales well with respect to the main memory size available, with encouraging preprocessing and run-time rendering speeds and without sacrificing the image quality.
A Novel Approach Makes Higher Order Wavelets Really Efficient for Radiosity
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Cuny, Francois; Alonso, Laurent; Holzschuch, Nicolas
Since wavelets were introduced in the radiosity algorithm 5, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study 13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets.
Video-based Approach to Human Animation
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Lao, Zhiqiang; Li, Ling
A method based on computer vision technologies is presented to determine the 3-D spatial locations of joints or feature points of a human body from human motion video. The proposed method first applies the geometric projection theory to obtain a set of feasible postures in some key frames according to predefined 2D video features and 3D-model features correspondence. Next it makes use of the available skeleton controlled human model to get a feasible posture for each key frame. The method is applied to a series of video images to animate artificial 3D human models.
Modeling the Motion of Dense Smoke in the Wind Field
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Rudolf, Marcin J.; Raczkowski, Jacek
This paper presents a volumetric animation technique for modeling the turbulent motion of very dense and turbulent smoke such as one coming from a steam engine. A new method of the wind field generation is proposed. Gas motion is determined by the integration of two independent vector layers. The first one is a combination of flow primitives and the second is created by stochastically generated turbulence. Special attention is taken of the proper construction of the turbulent layer. For the visualization purposes a simple volume raytracer is applied. Many light sources are taken into account to achieve photorealistic effects. Finally some interesting animations are overviewed. Computation times for a PC Pentium 200 and an SGI O2 workstation are compared to demonstrate the high efficiency of the method.
An Interactive Approach to Point Cloud Triangulation
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Kobbelt, Leif P.; Botsch, Mario
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons,. . .) as input data. In order to be able to robustly process huge data sets, we exploit graphics hardware features like the raster manager and the z-buffer for specific sub-tasks in the overall procedure. By this we significantly accelerate the stitching of mesh patches and obtain an algorithm for sub-sampling the data points in linear time. The target resolution and the triangle alignment in sub-regions of the resulting mesh can be controlled by adjusting the screen resolution and viewing transformation. An intuitive user interface provides a flexible tool for application dependent optimization of the mesh.
Automatic Surface Reconstruction from Point Sets in Space
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Attene, Marco; Spagnuolo, Michela
In this paper an algorithm is proposed that takes as input a generic set of unorganized points, sampled on a real object, and returns a closed interpolating surface. Specifically, this method generates a closed 2-manifold surface made of triangular faces, without limitations on the shape or genus of the original solid. The reconstruction method is based on generation of the Delaunay tetrahedralization of the point set, followed by a sculpturing process constrained to particular criteria. The main applications of this tool are in medical analysis and in reverse engineering areas. It is possible, for example, to reconstruct anatomical parts starting from surveys based on TACs or magnetic resonance.
Integrating Occlusion Culling and Levels of Detail through Hardly-Visible Sets
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Andujar, Carlos; Saona-Vazquez, Carlos; Navazo, Isabel; Brunet, Pere
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the handling of very large models in real-time visualization applications. We present a framework that combines both techniques to improve rendering times. Classical occlusion culling algorithms compute potentially visible sets (PVS), which are supersets of the sets of visible polygons. The novelty of our approach is to estimate the degree of visibility of each object of the PVS using synthesized coarse occluders. This allows to arrange the objects of each PVS into several Hardly-Visible Sets (HVS) with similar occlusion degree. According to image accuracy and frame rate requirements, HVS provide a way to avoid sending to the graphics pipeline those objects whose pixel contribution is low due to partial occlusion. The image error can be bounded by the user at navigation time. On the other hand, as HVS offer a tighter estimation of the pixel contribution for each scene object, it can be used for a more convenient selection of the level-of-detail at which objects are rendered. In this paper, we describe the new framework technique, provide details of its implementation using a visibility octree as the chosen occlusion culling data structure and show some experimental results on the image quality.
Representing Animations by Principal Components
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Alexa, Marc; Muller, Wolfgang
In this paper, we present a representation for three-dimensional geometric animation sequences. Different from standard key-frame techniques, this approach is based on the determination of principal animation components and decouples the animation from the underlying geometry. The new representation supports progressive animation compression with spatial, as well as temporal, level-of-detail and high compression ratios. The distinction of animation and geometry allows for mapping animations onto other objects.
Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Gopi, M.; Krishnan, S.; Silva, C.T.
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R 3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.
Collaborative Virtual Simulation Environment for Radiotherapy Treatment Planning
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Cai, Wenli; Walter, Stefan; Karangelis, Grigorios; Sakas, Georgios
The simulation of Radiotherapy Treatment Planning (RTP) is a normal procedure in oncology clinics carried out on a Simulator machine. The Virtual Simulation of RTP replaces the real Simulator machine with a virtual one by using the CT data sets of a patient instead of the real patient. In this paper, we present a collaborative virtual simulation environment of RTP, named EU-VIRTUOSO, which is based on volume rendering and telecommunication techniques. The RTP procedure is visualised on a virtual patient, which is created by using the CT data of the patient. Different volume rendering and volume interaction techniques, such as DRR, MIP, gradient surface, and iso-surface, supply physicians with high quality rendering images to simulate the real working environment of the Simulator machine. In the collaborative environment, physicians distributed at different locations can work together via network to plan the treatment or to validate the treatment plan on-line by a collaborative application sharing approach. Both concepts virtualised planning and collaborative planning improve the efficiency and accuracy of a radiotherapy treatment while reducing the effort for an individual patient.
Augmented Reality with Back-Projection Systems using Transflective Surfaces
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Bimber, Oliver; Encarnacao, L. Miguel; Schmalstieg, Dieter
In this paper, we introduce the concept of Extended VR (extending viewing space and interaction space of back-projection VR systems), by describing the use of a hand-held semi-transparent mirror to support augmented reality tasks with back-projection systems. This setup overcomes the problem of occlusion of virtual objects by real ones linked with such display systems. The presented approach allows an intuitive and effective application of immersive or semi-immersive virtual reality tasks and interaction techniques to an augmented surrounding space. Thereby, we use the tracked mirror as an interactive image-plane that merges the reflected graphics, which are displayed on the projection plane, with the transmitted image of the real environment. In our implementation, we also address traditional augmented reality problems, such as real-object registration and virtual-object occlusion. The presentation is complemented by a hypothesis of conceivable further setups that apply transflective surfaces to support an Extended VR environment.
A Multiresolution Model for Soft Objects Supporting Interactive Cuts and Lacerations
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Ganovelli, Fabio; Cignoni, Paolo; Montani, Claudio; Scopigno, Roberto
Performing a really interactive and physically-based simulation of complex soft objects is still an open problem in computer animation/simulation. Given the application domain of virtual surgery training, a complete model should be quite realistic, interactive and should enable the user to modify the topology of the objects. Recent papers propose the adoption of multiresolution techniques to optimize time performance by representing at high resolution only the object parts considered more important or critical. The speed up obtainable at simulation time are counterbalanced by the need of a preprocessing phase strongly dependent on the topology of the object, with the drawback that performing dynamic topology modification becomes a prohibitive issue. In this paper we present an approach that couples multiresolution and topological modifications, based on the adoption of a particle systems approach to the physical simulation. Our approach is based on a tetrahedral decomposition of the space, chosen both for its suitability to support a particle system and for the ready availability of many techniques recently proposed for the simplification and multiresolution management of 3D simplicial decompositions. The multiresolution simulation system is designed to ensure the required speedup and to support dynamic changes of the topology, e.g. due to cuts or lacerations of the represented tissue.
Directional Discretized Occluders for Accelerated Occlusion Culling
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Bernardini, Fausto; Klosowski, James T.; El-Sana, Jihad
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure and compute simple view-dependent polygonal occluders to replace the complex input geometry in subsequent visibility queries. When the user is inspecting and visualizing the input model, the computed occluders are used to avoid rendering geometry which cannot be seen. Our method has several advantages which allow it to perform conservative visibility queries efficiently and it does not require any special graphics hardware. The preprocessing step of our approach can also be used within the framework of other visibility culling methods which need to pre-select or pre-render occluders. In this paper, we describe our technique and its implementation in detail, and provide experimental evidence of its performance. In addition, we briefly discuss possible extensions of our algorithm.
Interactive High-Quality Maximum Intensity Projection
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Mroz, Lukas; Hauser, Helwig; Groller, Eduard
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data value, which is encountered along a corresponding viewing ray is depicted. MIP is, for example, commonly used to extract vascular structures from medical data sets (angiography). Due to lack of depth information in MIP images, animation or interactive variation of viewing parameters is frequently used for investigation. Up to now no MIP algorithms exist which are of both interactive speed and high quality. In this paper we present a high-quality MIP algorithm (trilinear interpolation within cells), which is up to 50 times faster than brute-force MIP and at least 20 times faster than comparable optimized techniques. This speed-up is accomplished by using an alternative storage scheme for volume cells (sorted by value) and by removing cells which do not contribute to any MIP projection (regardless of the viewing direction) in a preprocessing step. Also, a fast maximum estimation within cells is used to further speed up the algorithm.
Color Distribution - A New Approach to Texture Compression
(Blackwell Publishers Ltd and the Eurographics Association, 2000) Ivanov, Denis V.; Kuzmin, Yevgeniy P.
Texture compression is recently one of the most important topics of 3D scene rendering techniques, because it allows rendering more complicated high-resolution scenes. However, because of some special requirements for these type of techniques, the commonly used block decomposition approach may introduce visual degradation of image details due to lack of colors. We present here a new approach to texture compression, which allows sharing of one color by several blocks providing a larger number of unique colors in each particular block and the best compression ratio. We also present an iterative algorithm for obtaining distributed colors on a texture, and discuss some advantages of our approach. The paper concludes with comparison of our technique with S3TC and other block decomposition methods.

Browse

Browsing Issue 3 by Issue Date

Results Per Page

Sort Options