Issue 3

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 46

Modeling Surperspective Projection of Landscapes for Geographical Guide-Map Generation
(Blackwell Science Ltd and the Eurographics Association, 2002) Takahashi, Shigeo; Ohta, Naoya; Nakamura, Hiroko; Takeshima, Yuriko; Fujishiro, Issei
It is still challenging to generate hand-drawn pictures because they differ from ordinary photographs in that they are often drawn as seen from multiple viewpoints. This paper presents a new approach for modeling such surperspective projection based on shape deformation techniques. Specifically, surperspective landscape images for guide-maps are generated from 3D geographical elevation data. Our method first partitions a target geographical surface into feature areas to provide designers with landmarks suitable for editing. The system takes as input 2D visual effects, which are converted to 3D geometric constraints for geographical surface deformation. Using ordinary perspective projection, the deformed shape is then transformed into a target guide-map image where each landmark enjoys its own vista points. An algorithm for calculating such 2D visual effects semi-automatically from the geographical shape features is also considered.
Geometric Snakes for Triangular Meshes
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Lee, Y.; Lee, S.
Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In spite of much research in computer vision, automatic feature detection even for images still remains a difficult problem. To avoid this difficulty, semi-automatic or interactive techniques for image feature detection have been investigated. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect features on a mesh. Experimental results demonstrate that geometric snakes can successfully capture nearby features from user-specified initial positions.
A Solid Model Based Virtual Hairy Brush
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Xu, Songhua; Tang, Min; Lau, Francis; Pan, Yunhe
We present the detailed modeling of the hairy brush used typically in Chinese calligraphy. The complex model, which includes also a model for the ink and the paper, covers the various stages of the brush going through a calligraphy process. The model relies on the concept of writing primitives, which are the smallest units of hair clusters, to reduce the load on the simulation. Each such primitive is constructed through the general sweeping operation in CAD and described by a NURBS surface. The writing primitives dynamically adjust themselves during the virtual writing process, leaving an imprint on the virtual paper as they move. The behavior of the brush is an aggregation of the behavior of all the writing primitives. A software system based on the model has been built and tested. Samples of imitation artwork from using the system were obtained and found to be nearly indistinguishable from the real artwork.Categories and Subject Descriptors (according to ACM CCS): I.3.6 [Methodology and Techniques]: Interaction techniques I.3.5 [Computational Geometry and Object Modeling]: Physically based modeling I.3.4 [Graphics Utilities]: Paint systems
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Pascucci, V.
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension these techniques to the volumetric case would enable their use in a broad class of applications including solid modeling, scientific visualization and mesh generation. Unfortunately, major challenges remain unsolved both in the generalization of the combinatorial structure of the refinement procedure and in the analysis of the smoothness of the limit mesh.In this paper we mainly tackle the first part of the problem introducing a subdivision scheme that generalizes to 3D and higher dimensional meshes without the excessive vertex proliferation typical of tensor-product refinements. The main four qualities of our subdivision procedure are: (i) the rate of refinement does not grow with the dimension of the mesh, (ii) adaptive refinement of the mesh is possible without introducing special temporary cell decompositions, (iii) the cells of the base meshes can have virtually unrestricted topology, and (iv) 'sharp' features of different dimensions can be incorporated naturally.We use a narrow averaging mask that is applied to the vertices of the mesh and/or to eventual functions defined on the mesh. The general study of the limit smoothness of the approach requires new analysis techniques that are beyond the scope of this paper.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid, and object representations. Volumetric meshes, recursive subdivision methods.
Hardware Accelerated Interactive Vector Field Visualization: A level of detail approach
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Bordoloi, Udeepta; Shen, Han-Wei
This paper presents an interactive global visualization technique for dense vector fields using levels of detail. We introduce a novel scheme which combines an error-controlled hierarchical approach and hardware acceleration to produce high resolution visualizations at interactive rates. Users can control the trade-off between computation time and image quality, producing visualizations amenable for situations ranging from high frame-rate previewing to accurate analysis. Use of hardware texture mapping allows the user to interactively zoom in and explore the data, and also to configure various texture parameters to change the look and feel of the visualization. We are able to achieve sub-second rates for dense LIC-like visualizations with resolutions in the order of a million pixels for data of similar dimensions.Categories and Subject Descriptors (according to ACM CCS): I.3 [Computer Graphics]: Applications
Using Perceptual Texture Masking for Efficient Image Synthesis
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Walter, Bruce; Pattanaik, Sumanta N.; Greenberg, Donald P.
Texture mapping has become indispensable in image synthesis as an inexpensive source of rich visual detail. Less obvious, but just as useful, is its ability to mask image errors due to inaccuracies in geometry or lighting. This ability can be used to substantially accelerate rendering by eliminating computations when the resulting errors will be perceptually insignificant.Our new method precomputes the masking ability of textures using aspects of the JPEG image compression standard. This extra information is stored as threshold elevation factors in the texture's mip-map and interpolated at image generation time as part of the normal texture lookup process. Any algorithm which uses error tolerances or visibility thresholds can then take advantage of texture masking. Applications to adaptive shadow testing, irradiance caching, and path tracing are demonstrated.Unlike prior methods, our approach does not require that initial images be computed before masking can be exploited and incurs only negligible runtime computational overhead. Thus, it is much easier to integrate with existing rendering systems for both static and dynamic scenes and yields computational savings even when only small amounts of texture masking are present.Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Color, shading, shadowing, and texture
Virtual Visual Servoing: a framework for real-time augmented reality
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Marchand, Eric; Chaumette, Francois
This paper presents a framework to achieve real-time augmented reality applications. We propose a framework based on the visual servoing approach well known in robotics. We consider pose or viewpoint computation as a similar problem to visual servoing. It allows one to take advantage of all the research that has been carried out in this domain in the past. The proposed method features simplicity, accuracy, efficiency, and scalability wrt. to the camera model as well as wrt. the features extracted from the image. We illustrate the efficiency of our approach on augmented reality applications with various real image sequences.
A Simple and Robust Mutation Strategy for the Metropolis Light Transport Algorithm
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Kelemen, Csaba; Szirmay-Kalos, Laszlo; Antal, Gyorgy; Csonka, Ferenc
This paper presents a new mutation strategy for the Metropolis light transport algorithm, which works in the unit cube of pseudo-random numbers instead of mutating in the path space. This transformation makes the integrand have lower variation and thus increases the acceptance probability of the mutated samples. Higher acceptance ratio, in turn, reduces the correlation of the samples, which increases the speed of convergence. We use both local mutations that choose a new random sample in the neighborhood of the previous one, and global mutations that make 'large steps', and find the samples independently. Local mutations smooth out the result, while global mutations guarantee the ergodicity of the process. Due to the fact that samples are generated independently in large steps, this method can also be considered as a combination of the Metropolis algorithm with a classical random walk. If we use multiple importance sampling for this combination, the combined method will be as good at bright regions as the Metropolis algorithm and at dark regions as random walks. The resulting scheme is robust, efficient, but most importantly, is easy to implement and to combine with an arbitrary random-walk algorithm.
Dynamic Textures for Image-based Rendering of Fine-Scale 3D Structure and Animation of Non-rigid Motion
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Cobzas, Dana; Yerex, Keith; Jagersand, Martin
The problem of capturing real world scenes and then accurately rendering them is particularly difficult for fine-scale 3D structure. Similarly, it is difficult to capture, model and animate non-rigid motion. We present a method where small image changes are captured as a time varying (dynamic) texture. In particular, a coarse geometry is obtained from a sample set of images using structure from motion. This geometry is then used to subdivide the scene and to extract approximately stabilized texture patches. The residual statistical variability in the texture patches is captured using a PCA basis of spatial filters. The filters coefficients are parameterized in camera pose and object motion. To render new poses and motions, new texture patches are synthesized by modulating the texture basis. The texture is then warped back onto the coarse geometry. We demonstrate how the texture modulation and projective homography-based warps can be achieved in real-time using hardware accelerated OpenGL. Experiments comparing dynamic texture modulation to standard texturing are presented for objects with complex geometry (a flower) and non-rigid motion (human arm motion capturing the non-rigidities in the joints, and creasing of the shirt).Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Image Based Rendering
Representation of Pseudo Inter-reflection and Transparency by Considering Characteristics of Human Vision
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Matsuoka, H.; Takeuchi, T.; Kitazawa, H.; Onozawa, A.
We have succeeded in developing a quick and fully automated system that can generate photo-realistic 3D CG data based on a real object. A major factor in this success comes from our findings through psychophysical experiments that human observers do not have an accurate idea of what should be actually reflected as inter-reflections on the surface of an object. Taking advantage of this characteristic of human vision, we propose a new inter-reflection representation technique in which inter-reflections are simulated by allowing the same quantity of reflection components as there are in the background to pass through the object. Since inter-reflection and transparency are calculated by the same algorithm, our system can capture 3D CG data from various real objects having a strong inter-reflection, such as plastic and porcelain items or translucent glass and acrylic resin objects. The synthetic images from the 3D CG data generated with this pseudo inter-reflection and transparency look very natural. In addition, the 3D CG data and synthetic images are produced quickly at a lower cost.
STRANDS: Interactive Simulation of Thin Solids using Cosserat Models
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Pai, Dinesh K.
Strandsare thin elastic solids that are visually well approximated as smooth curves, and yet possess essential physical behaviors characteristic of solid objects such as twisting. Common examples in computer graphics include: sutures, catheters, and tendons in surgical simulation; hairs, ropes, and vegetation in animation. Physical models based on spring meshes or 3D finite elements for such thin solids are either inaccurate or inefficient for interactive simulation. In this paper we show that models based on the Cosserat theory of elastic rods are very well suited for interactive simulation of these objects. The physical model reduces to a system of spatial ordinary differential equations that can be solved efficiently for typical boundary conditions. The model handles the important geometric non-linearity due to large changes in shape. We introduce Cosserat-type physical models, describe efficient numerical methods for interactive simulation of these models, and implementation results.
Transparency in Interactive Technical Illustrations
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Diepstraten, J.; Weiskopf, D.; Ertl, T.
This paper describes how technical illustrations containing opaque and non-opaque objects can be automatically generated. Traditional methods to show transparency in manual drawings are evaluated to extract a small and effective set of rules for computer-based rendering of technical illustrations, leading to a novel view-dependent transparency model. We propose a hardware-accelerated depth sorting algorithm in image-space which specifically meets the requirements of our transparency model. In this way, real-time rendering of semi-transparent technical illustrations is achieved. Finally, it is described how our approach can be combined with other methods in the field of non-photorealistic rendering in order to enhance the visual perception of technical illustrations.Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Color, shading, shadowing and texture
Advanced Radiance Estimation For Photon Map Global Illumination
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Hey, Heinrich; Purgathofer, Werner
We present a new method to compute radiance in photon map based global illumination simulation for polygonal scenes with general bidirectional scattering distribution functions (BSDFs). Our new radiance estimation uses the actual geometry in the neighborhood of the illuminated point, and does not assume that the nearest neighbor photons lie in the same plane as the point, nor that they are distributed in a circular area around that point. This allows us to achieve accurate indirect illumination by direct visualization of the photon map - which is especially important for the simulation of caustics(LS+DS*Epaths) - even in the vicinity of edges and corners of objects, and on surfaces with differently oriented small geometric details.
Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Scheib, Vincent; Haber, Jorg; Lin, Ming C.; Seidel, Hans-Peter
We present a method to efficiently construct and render a smooth surface for approximation of large functional scattered data. Using a subdivision surface framework and techniques from terrain rendering, the resulting surface can be explored from any viewpoint while maintaining high surface fairness and interactive frame rates. We show the approximation error to be sufficiently small for several large data sets. Our system allows for adaptive simplification and provides continuous levels of detail, taking into account the local variation and distribution of the data.Categories and Subject Descriptors (according to ACM CCS): G.1.2 [Approximation]: Approximation of surfaces, Least squares approximation, Piecewise polynomial approximation; I.3.3 [Picture/Image Generation]: Display algorithms, Viewing algorithms; I.3.5 [Computational Geometry and Object Modeling]: Surface representation.
Texture Particles
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Dischler, J.-M.; Maritaud, K.; Levy, B.; Ghazanfarpour, D.
This paper presents an analytical extension of texture synthesis techniques based on the distribution of elementary texture components. Our approach is similar to the bombing, cellular, macrostructured and lapped textures techniques, but provides the user with more control on both the texture analysis and synthesis phases. Therefore, high quality results can be obtained for a large number of structured or stochastic textures (bricks, marble, lawn, etc.). The analysis consists in decomposing textures into elementary components - that we call 'texture particles' - and for which we analyze their specific spatial arrangements. The synthesis then consists in recomposing similar textures directly on arbitrary surfaces by taking into account the previously computed arrangements, extended to 3D surfaces. Compared to 'pixel-based' analysis and synthesis methods, which have been recently generalized to arbitrary surfaces, our approach has three major advantages: (1) it is fast, which allows the user to interactively control the synthesis process. This further allows us to propose a large number of tools, granting a high degree of artistic freedom to the user. (2) It avoids the visual deterioration of the texture components by preserving their shapes as well as their spatial arrangements. (3) The texture particles can be not only images, but also 3D geometric elements, which extends significantly the domain of application.
Projective Texture Mapping with Full Panorama
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Kim, Dongho; Hahn, James K.
Projective texture mapping is used to project a texture map onto scene geometry. It has been used in many applications, since it eliminates the assignment of fixed texture coordinates and provides a good method of representing synthetic images or photographs in image-based rendering. But conventional projective texture mapping has limitations in the field of view and the degree of navigation because only simple rectangular texture maps can be used.In this work, we propose the concept of panoramic projective texture mapping (PPTM). It projects cubic or cylindrical panorama onto the scene geometry. With this scheme, any polygonal geometry can receive the projection of a panoramic texture map, without using fixed texture coordinates or modeling many projective texture mapping. For fast real-time rendering, a hardware-based rendering method is also presented. Applications of PPTM include panorama viewer similar to QuicktimeVR and navigation in the panoramic scene, which can be created by image-based modeling techniques.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Viewing Algorithms; I.3.7 [Computer Graphics]: Color, Shading, Shadowing, and Texture
Color Section
(Blackwell Publishers Ltd and the Eurographics Association., 2002)
Deferred, Self-Organizing BSP Trees
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Ar, Sigal; Montag, Gil; Tal, Ayellet
bsptrees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how this leads to the creation ofbsptrees that are small, do not require much preprocessing time, and respond very efficiently to sequences of collision queries.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling I.3.6 [Computer Graphics]: Graphics data structures and data types, Interaction techniques I.3.7 [Computer Graphics]: Virtual reality
Interactive Visualization with Programmable Graphics Hardware
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Ertl, Thomas
One of the main scientific goals of visualization is the development of algorithms and appropriate data models which facilitate interactive visual analysis and direct manipulation of the increasingly large data sets which result from simulations running on massive parallel computer systems, from measurements employing fast high-resolution sensors, or from large databases and hierarchical information spaces.This task can only be achieved with the optimization of all stages of the visualization pipeline: filtering, compression, and feature extraction of the raw data sets, adaptive visualization mappings which allow the users to choose between speed and accuracy, and exploiting new graphics hardware features for fast and high-quality rendering. The recent introduction of advanced programmability in widely available graphics hardware has already led to impressive progress in the area of volume visualization. However, besides the acceleration of the final rendering, flexible graphics hardware is increasingly being used also for the mapping and filtering stages of the visualization pipeline, thus giving rise to new levels of interactivity in visualization applications. The talk will present recent results of applying programmable graphics hardware in various visualization algorithms covering volume data, flow data, terrains, NPR rendering, and distributed and remote applications.
Real-time Animation of Dressed Virtual Humans
(Blackwell Publishers, Inc and the Eurographics Association, 2002) Cordier, Frederic; Magnenat-Thalmann, Nadia
In this paper, we describe a method for cloth animation in real-time. The algorithm works in a hybrid manner exploiting the merits of both the physical-based and geometric deformations. It makes use of predetermined conditions between the cloth and the body model, avoiding complex collision detection and physical deformations wherever possible. Garments are segmented into pieces that are simulated by various algorithms, depending on how they are laid on the body surface and whether they stick or flow on it. Tests show that the method is well suited to fully dressed virtual human models, achieving real-time performance compared to ordinary cloth-simulations.

Browse

Browsing Issue 3 by Issue Date

Results Per Page

Sort Options