27-Issue 2
Permanent URI for this collection
Browse
Browsing 27-Issue 2 by Issue Date
Now showing 1 - 20 of 59
Results Per Page
Sort Options
Item Surface Reconstruction From Non-parallel Curve Networks(The Eurographics Association and Blackwell Publishing Ltd, 2008) Liu, L.; Bajaj, C.; Deasy, J. O.; Low, D. A.; Ju, T.Building surfaces from cross-section curves has wide applications including bio-medical modeling. Previous work in this area has mostly focused on connecting simple closed curves on parallel cross-sections. Here we consider the more general problem where input data may lie on non-parallel cross-sections and consist of curve networks that represent the segmentation of the underlying object by different material or tissue types (e.g., skin, muscle, bone, etc.) on each cross-section. The desired output is a surface network that models both the exterior surface and the internal partitioning of the object. We introduce an algorithm that is capable of handling curve networks of arbitrary shape and topology on cross-section planes with arbitrary orientations. Our algorithm is simple to implement and is guaranteed to produce a closed surface network that interpolates the curve network on each cross-section. Our method is demonstrated on both synthetic and bio-medical examples.Item Sketching and Composing Widgets for 3D Manipulation(The Eurographics Association and Blackwell Publishing Ltd, 2008) Schmidt, Ryan; Singh, Karan; Balakrishnan, RavinWe present an interface for 3D object manipulation in which standard transformation tools are replaced with transient 3D widgets invoked by sketching context-dependent strokes. The widgets are automatically aligned to axes and planes determined by the user s stroke. Sketched pivot-points further expand the interaction vocabulary. Using gestural commands, these basic elements can be assembled into dynamic, user-constructed 3D transformation systems. We supplement precise widget interaction with techniques for coarse object positioning and snapping. Our approach, which is implemented within a broader sketch-based modeling system, also integrates an underlying widget history to enable the fluid transfer of widgets between objects. An evaluation indicates that users familiar with 3D manipulation concepts can be taught how to efficiently use our system in under an hour.Item Curvature-Domain Shape Processing(The Eurographics Association and Blackwell Publishing Ltd, 2008) Eigensatz, Michael; Sumner, Robert W.; Pauly, MarkWe propose a framework for 3D geometry processing that provides direct access to surface curvature to facilitate advanced shape editing, filtering, and synthesis algorithms. The central idea is to map a given surface to the curvature domain by evaluating its principle curvatures, apply filtering and editing operations to the curvature distribution, and reconstruct the resulting surface using an optimization approach. Our system allows the user to prescribe arbitrary principle curvature values anywhere on the surface. The optimization solves a nonlinear least-squares problem to find the surface that best matches the desired target curvatures while preserving important properties of the original shape. We demonstrate the effectiveness of this processing metaphor with several applications, including anisotropic smoothing, feature enhancement, and multi-scale curvature editing.Item Detail-In-Context Visualization for Satellite Imagery(The Eurographics Association and Blackwell Publishing Ltd, 2008) Boettger, Joachim; Preiser, Martin; Balzer, Michael; Deussen, OliverWe use the complex logarithm as a transformation for the visualization and navigation of highly complex satellite and aerial imagery. The resulting depictions show details and context with greatly different scales in one seamless image while avoiding local distortions. We motivate our approach by showing its relations to the ordinary perspective views and classical map projections. We discuss how to organize and process the huge amount of imagery in realtime using modern graphics hardware with an extended clipmapping technique. Finally, we provide details and experiences concerning the interpretation of and interaction with the resulting representations.Item Articulated Object Reconstruction and Markerless Motion Capture from Depth Video(The Eurographics Association and Blackwell Publishing Ltd, 2008) Pekelny, Yuri; Gotsman, CraigWe present an algorithm for acquiring the 3D surface geometry and motion of a dynamic piecewise-rigid object using a single depth video camera. The algorithm identifies and tracks the rigid components in each frame, while accumulating the geometric information acquired over time, possibly from different viewpoints. The algorithm also reconstructs the dynamic skeleton of the object, thus can be used for markerless motion capture. The acquired model can then be animated to novel poses. We show the results of the algorithm applied to synthetic and real depth video.Item Image-based Shaving(The Eurographics Association and Blackwell Publishing Ltd, 2008) Nguyen, Minh Hoai; Lalonde, Jean-Francois; Efros, Alexei A.; De la Torre, FernandoMany categories of objects, such as human faces, can be naturally viewed as a composition of several different layers. For example, a bearded face with glasses can be decomposed into three layers: a layer for glasses, a layer for the beard and a layer for other permanent facial features. While modeling such a face with a linear subspace model could be very difficult, layer separation allows for easy modeling and modification of some certain structures while leaving others unchanged. In this paper, we present a method for automatic layer extraction and its applications to face synthesis and editing. Layers are automatically extracted by utilizing the differences between subspaces and modeled separately. We show that our method can be used for tasks such beard removal (virtual shaving), beard synthesis, and beard transfer, among others.Item High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation(The Eurographics Association and Blackwell Publishing Ltd, 2008) Pavic, Darko; Kobbelt, LeifWe present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and computes (self-)intersection free offsets that do not miss small and thin components. The results are correct within a prescribed ?-tolerance. This is achieved by using a volumetric approach where the offset surface is defined as the union of a set of spheres, cylinders, and prisms instead of surface-based approaches that generally construct an offset surface by shifting the input mesh in normal direction. Since we are using the unsigned distance field, we can handle any type of topological inconsistencies including non-manifold configurations and degenerate triangles. A simple but effective mesh operation allows us to detect and include sharp features (shocks) into the output mesh and to preserve them during post-processing (decimation and smoothing). We discretize the distance function by an efficient multi-level scheme on an adaptive octree data structure. The problem of limited voxel resolutions inherent to every volumetric approach is avoided by breaking the bounding volume into smaller tiles and processing them independently. This allows for almost arbitrarily high voxel resolutions on a commodity PC while keeping the output mesh complexity low. The quality and performance of our algorithm is demonstrated for a number of challenging examples.Item Frontmatter(The Eurographics Association and Blackwell Publishing Ltd, 2008)Item Real-Time Rendering and Editing of Vector-based Terrains(The Eurographics Association and Blackwell Publishing Ltd, 2008) Bruneton, Eric; Neyret, FabriceWe present a method to populate very large terrains with very detailed features such as roads, rivers, lakes and fields. These features can be interactively edited, and the landscape can be explored in real time at any altitude from flight view to car view. We use vector descriptions of linear and areal features, with associated shaders to specify their appearance (terrain color and material), their footprint (effect on terrain shape), and their associated objects (bridges, hedges, etc.).In order to encompass both very large terrains and very fine details we rely on a view dependent quadtree refinement scheme. New quads are generated when needed and cached on the GPU. For each quad we produce on the GPU an appearance texture, a footprint texture, and some object meshes, based on the features vector description and their associated shaders. Adaptive refinement, procedural vector features and a mipmap pyramid provide three LOD mechanisms for small, medium and large scale quads. Our results and attached video show high performance with high visual quality.Item Dynamic Sampling and Rendering of Algebraic Point Set Surfaces(The Eurographics Association and Blackwell Publishing Ltd, 2008) Guennebaud, Gael; Germann, Marcel; Gross, MarkusAlgebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisit the spherical fitting problem and provide a new, more generic solution that includes intuitive parameters for curvature control of the fitted spheres. As a second contribution we present a novel real-time rendering system of such surfaces using a dynamic up-sampling strategy combined with a conventional splatting algorithm for high quality rendering. Our approach also includes a new view dependent geometric error tailored to efficient and adaptive up-sampling of the surface. One of the key features of our system is its high degree of flexibility that enables us to achieve high performance even for highly dynamic data or complex models by exploiting temporal coherence at the primitive level. We also address the issue of efficient spatial search data structures with respect to construction, access and GPU friendliness. Finally, we present an efficient parallel GPU implementation of the algorithms and search structures.Item Sketch-Based Procedural Surface Modeling and Compositing Using Surface Trees(The Eurographics Association and Blackwell Publishing Ltd, 2008) Schmidt, Ryan; Singh, KaranWe present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeling. A combination of sketch-based and traditional modeling tools are used to design soft displacements, sharp creases, extrusions along 3D paths, and topological holes and handles. Using local parameterizations, these edits are combined in a dynamic hierarchy, enabling procedural operations like linked copy-and-paste and drag-and-drop layer-based editing. Such dynamic, layered surface compositing is formalized as a Surface Tree, an analog of CSG trees which generalizes previous hierarchical surface modeling techniques. By anchoring tree nodes in the parameter space of lower layers, our surface tree implementation can better preserve the semantics of an edit as the underlying surface changes. Details of our implementation are described, including an efficient procedural mesh data structure.Item Texture Synthesis From Photographs(The Eurographics Association and Blackwell Publishing Ltd, 2008) Eisenacher, C.; Lefebvre, S.; Stamminger, M.The goal of texture synthesis is to generate an arbitrarily large high-quality texture from a small input sample. Generally, it is assumed that the input image is given as a flat, square piece of texture, thus it has to be carefully prepared from a picture taken under ideal conditions. Instead we would like to extract the input texture from any surface from within an arbitrary photograph. This introduces several challenges: Only parts of the photograph are covered with the texture of interest, perspective and scene geometry introduce distortions, and the texture is non-uniformly sampled during the capture process. This breaks many of the assumptions used for synthesis.In this paper we combine a simple novel user interface with a generic per-pixel synthesis algorithm to achieve high-quality synthesis from a photograph. Our interface lets the user locally describe the geometry supporting the textures by combining rational Bezier patches. These are particularly well suited to describe curved surfaces under projection. Further, we extend per-pixel synthesis to account for arbitrary texture sparsity and distortion, both in the input image and in the synthesis output. Applications range from synthesizing textures directly from photographs to high-quality texture completion.Item Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding(The Eurographics Association and Blackwell Publishing Ltd, 2008) Ropinski, Timo; Meyer-Spradow, Jennis; Diepenbrock, Stefan; Mensmann, Joerg; Hinrichs, KlausWe propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In contrast to ambient occlusion approaches for polygonal data, techniques for volumetric data sets have to face additional challenges, since by changing rendering parameters, such as the transfer function or the thresholding, the structure of the data set and thus the light interactions may vary drastically. Therefore, during a preprocessing step which is independent of the rendering parameters we capture light interactions for all combinations of structures extractable from a volumetric data set. In order to compute the light interactions between the different structures, we combine this preprocessed information during rendering based on the rendering parameters defined interactively by the user. Thus our method supports interactive exploration of a volumetric data set but still gives the user control over the most important rendering parameters. For instance, if the user alters the transfer function to extract different structures from a volumetric data set the light interactions between the extracted structures are captured in the rendering while still allowing interactive frame rates. Compared to known local illumination models for volume rendering our method does not introduce any substantial rendering overhead and can be integrated easily into existing volume rendering applications. In this paper we will explain our approach, discuss the implications for interactive volume rendering and present the achieved results.Item GPU Accelerated Direct Volume Rendering on an Interactive Light Field Display(The Eurographics Association and Blackwell Publishing Ltd, 2008) Agus, Marco; Gobbetti, Enrico; Guitian, Jose Antonio Iglesias; Marton, Fabio; Pintore, GiovanniWe present a GPU accelerated volume ray casting system interactively driving a multi-user light field display. The display, driven by a single programmable GPU, is based on a specially arranged array of projectors and a holographic screen and provides full horizontal parallax. The characteristics of the display are exploited to develop a specialized volume rendering technique able to provide multiple freely moving naked-eye viewers the illusion of seeing and manipulating virtual volumetric objects floating in the display workspace. In our approach, a GPU ray-caster follows rays generated by a multiple-center-of-projection technique while sampling pre-filtered versions of the dataset at resolutions that match the varying spatial accuracy of the display. The method achieves interactive performance and provides rapid visual understanding of complex volumetric data sets even when using depth oblivious compositing techniques.Item Reduced Depth and Visual Hulls of Complex 3D Scenes(The Eurographics Association and Blackwell Publishing Ltd, 2008) Bogomjakov, Alexander; Gotsman, CraigDepth and visual hulls are useful for quick reconstruction and rendering of a 3D object based on a number of reference views. However, for many scenes, especially multi-object, these hulls may contain significant artifacts known as phantom geometry. In depth hulls the phantom geometry appears behind the scene objects in regions occluded from all the reference views. In visual hulls the phantom geometry may also appear in front of the objects because there is not enough information to unambiguously imply the object positions.In this work we identify which parts of the depth and visual hull might constitute phantom geometry. We define the notion of reduced depth hull and reduced visual hull as the parts of the corresponding hull that are phantom-free. We analyze the role of the depth information in identification of the phantom geometry. Based on this, we provide an algorithm for rendering the reduced depth hull at interactive frame-rates and suggest an approach for rendering the reduced visual hull. The rendering algorithms take advantage of modern GPU programming techniques.Our techniques bypass explicit reconstruction of the hulls, rendering the reduced depth or visual hull directly from the reference views.Item Modeling a Generic Tone-mapping Operator(The Eurographics Association and Blackwell Publishing Ltd, 2008) Mantiuk, Rafal; Seidel, Hans-PeterAlthough several new tone-mapping operators are proposed each year, there is no reliable method to validate their performance or to tell how different they are from one another. In order to analyze and understand the behavior of tone-mapping operators, we model their mechanisms by fitting a generic operator to an HDR image and its tone-mapped LDR rendering. We demonstrate that the majority of both global and local tone-mapping operators can be well approximated by computationally inexpensive image processing operations, such as a per-pixel tone curve, a modulation transfer function and color saturation adjustment. The results produced by such a generic tone-mapping algorithm are often visually indistinguishable from much more expensive algorithms, such as the bilateral filter. We show the usefulness of our generic tone-mapper in backward-compatible HDR image compression, the black-box analysis of existing tone mapping algorithms and the synthesis of new algorithms that are combination of existing operators.Item A Semi-Lagrangian CIP Fluid Solver without Dimensional Splitting(The Eurographics Association and Blackwell Publishing Ltd, 2008) Kim, Doyub; Song, Oh-young; Ko, Hyeong-SeokIn this paper, we propose a new constrained interpolation profile (CIP) method that is stable and accurate but requires less amount of computation compared to existing CIP-based solvers. CIP is a high-order fluid advection solver that can reproduce rich details of fluids. It has third-order accuracy but its computation is performed over a compact stencil. These advantageous features of CIP are, however, diluted by the following two shortcomings: (1) CIP contains a defect in the utilization of the grid data, which makes the method suitable only for simulations with a tight CFL restriction; and (2) CIP does not guarantee unconditional stability. There have been several attempts to fix these problems in CIP, but they have been only partially successful. The solutions that fixed both problems ended up introducing other undesirable features, namely increased computation time and/or reduced accuracy. This paper proposes a novel modification of the original CIP method that fixes all of the above problems without increasing the computational load or reducing the accuracy. Both quantitative and visual experiments were performed to test the performance of the new CIP in comparison to existing fluid solvers. The results show that the proposed method brings significant improvements in both accuracy and speed.Item Photo-realistic Rendering of Metallic Car Paint from Image-Based Measurements(The Eurographics Association and Blackwell Publishing Ltd, 2008) Rump, Martin; Mueller, Gero; Sarlette, Ralf; Koch, Dirk; Klein, ReinhardState-of-the-art car paint shows not only interesting and subtle angular dependency but also significant spatial variation. Especially in sunlight these variations remain visible even for distances up to a few meters and give the coating a strong impression of depth which cannot be reproduced by a single BRDF model and the kind of procedural noise textures typically used. Instead of explicitly modeling the responsible effect particles we propose to use image-based reflectance measurements of real paint samples and represent their spatial varying part by Bidirectional Texture Functions (BTF). We use classical BRDF models like Cook-Torrance to represent the reflection behavior of the base paint and the highly specular finish and demonstrate how the parameters of these models can be derived from the BTF measurements. For rendering, the image-based spatially varying part is compressed and efficiently synthesized. This paper introduces the first hybrid analytical and image-based representation for car paint and enables the photo-realistic rendering of all significant effects of highly complex coatings.Item GPU-based Fast Ray Casting for a Large Number of Metaballs(The Eurographics Association and Blackwell Publishing Ltd, 2008) Kanamori, Yoshihiro; Szego, Zoltan; Nishita, TomoyukiMetaballs are implicit surfaces widely used to model curved objects, represented by the isosurface of a density field defined by a set of points. Recently, the results of particle-based simulations have been often visualized using a large number of metaballs, however, such visualizations have high rendering costs. In this paper we propose a fast technique for rendering metaballs on the GPU. Instead of using polygonization, the isosurface is directly evaluated in a per-pixel manner. For such evaluation, all metaballs contributing to the isosurface need to be extracted along each viewing ray, on the limited memory of GPUs. We handle this by keeping a list of metaballs contributing to the isosurface and efficiently update it. Our method neither requires expensive precomputation nor acceleration data structures often used in existing ray tracing techniques. With several optimizations, we can display a large number of moving metaballs quickly.Item Real-Time Translucent Rendering Using GPU-based Texture Space Importance Sampling(The Eurographics Association and Blackwell Publishing Ltd, 2008) Chang, Chih-Wen; Lin, Wen-Chieh; Ho, Tan-Chi; Huang, Tsung-Shian; Chuang, Jung-HongWe present a novel approach for real-time rendering of translucent surfaces. The computation of subsurface scattering is performed by first converting the integration over the 3D model surface into an integration over a 2D texture space and then applying importance sampling based on the irradiance stored in the texture. Such a conversion leads to a feasible GPU implementation and makes real-time frame rate possible. Our implementation shows that plausible images can be rendered in real time for complex translucent models with dynamic light and material properties. For objects with more apparent local effect, our approach generally requires more samples that may downgrade the frame rate. To deal with this case, we decompose the integration into two parts, one for local effect and the other for global effect, which are evaluated by the combination of available methods [DS03, MKB* 03a] and our texture space importance sampling, respectively. Such a hybrid scheme is able to steadily render the translucent effect in real time with a fixed amount of samples.
- «
- 1 (current)
- 2
- 3
- »