ACM CSS Research Articles

Introduction to Probabilistic Concurrent Systems

The first part of the paper is an introduction to the theory of probabilistic concurrent systems under a partial order semantics. Key definitions and results are given and illustrated on examples. The second part includes contributions. We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are “locally commutative” concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique probabilistic dynamics, and we characterize these systems by means of their combinatorial properties. ACM CSS: G.2.1; F.1.1

The State of the Art in Flow Visualisation: Feature Extraction and Tracking

Abstract Flow visualisation is an attractive topic in data visualisation, offering great challenges for research. Very large data sets must be processed, consisting of multivariate data at large numbers of grid points, often arranged in many time steps. Recently, the steadily increasing performance of computers again has become a driving force for new advances in flow visualisation, especially in techniques based on texturing, feature extraction, vector field clustering, and topology extraction. In this article we present the state of the art in feature‐based flow visualisation techniques. We will present numerous feature extraction techniques, categorised according to the type of feature. Next, feature tracking and event detection algorithms are discussed, for studying the evolution of features in time‐dependent data sets. Finally, various visualisation techniques are demonstrated. ACM CSS: I.3.8 Computer Graphics—applications

Bias Compensation for Photon Maps

Abstract Density estimation techniques such as the photon map method rely on a particle transport simulation to reconstruct indirect illumination, which is proportional to the particle density. In the photon map framework, particles are usually located using nearest‐neighbour methods due to their generality. However, these methods have an inherent tradeoff between local bias and noise in the reconstructed illumination, which depends on the density estimate bandwidth. This paper presents a bias compensating operator for nearest‐neighbour density estimation which adapts the bandwidth according to the estimated bias in the reconstructed illumination. ACM CSS: I.3.7 Three‐Dimensional Graphics and Realism Raytracing

BRDF Measurement Modelling using Wavelets for Efficient Path Tracing

Abstract Physically based rendering needs numerical models from real measurements, or analytical models from material definitions, of the Bidirectional Reflectance Distribution Function (BRDF). However, measured BRDF data sets are too large and provide no functionalities to be practically used in Monte Carlo path tracing algorithms. In this paper, we present a wavelet‐based generic BRDF model suitable for both physical analysis and path tracing. The model is based on the separation of spectral and geometrical aspect of the BRDF and allows a compact and efficient representation of isotropic, anisotropic and/or spectral BRDFs. After a brief survey of BRDF and wavelet theory, we present our software architecture for generic wavelet transform and how to use it to model BRDFs. Then, modelling results are presented on real and virtual BRDF measurements. Finally, we show how to exploit the multiresolution property of the wavelet encoding to reduce the variance by importance sampling in a path tracing algorithm. ACM CSS: I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism

A Survey of Inverse Rendering Problems

Abstract Inverse rendering problems usually represent extremely complex and costly processes, but their importance in many research areas is well known. In particular, they are of extreme importance in lighting engineering, where potentially costly mistakes usually make it unfeasible to test design decisions on a model. In this survey we present the main ideas behind these kinds of problems, characterize them, and summarize work developed in the area, revealing problems that remain unsolved and possible areas of further research. ACM CSS: I.3.6 Computer Graphics Methodology and Techniques I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism I.4.1 Image Processing and Computer Vision Digitization and Image Capture I.4.7 Image Processing and Computer Vision Feature Measurement I.4.8 Image Processing and Computer Vision Scene Analysis

Soft Object Modelling with Generalised ChainMail — Extending the Boundaries of Web‐based Graphics

Abstract Soft object modelling is crucial in providing realistic simulation of many surgical procedures. High accuracy is achievable using the Finite Element Method (FEM), but significant computational power is required. We are interested in providing Web‐based surgical training simulation where such computational power is not available, but in return lower accuracy is often sufficient. A useful alternative to FEM is the 3D ChainMail algorithm that models elements linked in a regular, rectangular mesh, mimicking the behaviour of chainmail armour. An important aspect is the ability to make topology changes for example by cutting — an aspect that FEM finds difficult. Our contribution is to extend the 3D ChainMail technique to arbitrary grids in 2D and 3D. This extends the range of applications that can be addressed by the ChainMail approach, to include surfaces and volumes defined on triangular and tetrahedral meshes. We have successfully deployed the algorithm in a Web‐based environment, using VRML and Java linked through the External Authoring Interface. ACM CSS: I.3.5 Computer graphics: Computional Geometry and Object Modelling, I.3.2 Computer Graphics: Graphics Systems, J.3 Life and Medical Sciences

Automatic View Selection Using Viewpoint Entropy and its Application to Image‐Based Modelling

Abstract In the last decade a new family of methods, namely Image‐Based Rendering, has appeared. These techniques rely on the use of precomputed images to totally or partially substitute the geometric representation of the scene. This allows to obtain realistic renderings even with modest resources. The main problem is the amount of data needed, mainly due to the high redundancy and the high computational cost of capture. In this paper we present a new method to automatically determine the correct camera placement positions in order to obtain a minimal set of views for Image‐Based Rendering. The input is a 3D polyhedral model including textures and the output is a set of views that sample all visible polygons at an appropriate rate. The viewpoints should cover all visible polygons with an adequate quality, so that we sample the polygons at sufficient rate. This permits to avoid the excessive redundancy of the data existing in several other approaches. We also reduce the cost of the capturing process, as the number of actually computed reference views decreases. The localization of interesting viewpoints is performed with the aid of an information theory‐based measure, dubbed viewpoint entropy. This measure is used to determine the amount of information seen from a viewpoint. Next we develop a greedy algorithm to minimize the number of images needed to represent a scene. In contrast to other approaches, our system uses a special preprocess for textures to avoid artifacts appearing in partially occluded textured polygons. Therefore no visible detail of these images is lost. ACM CSS: I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism

Local Exact Particle Tracing on Unstructured Grids

Abstract For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation

Recent Developments and Applications of Haptic Devices

Abstract Over recent years a variety of haptic feedback devices have been developed and are being used in a number of important applications. They range from joysticks used in the entertainment industry to specialised devices used in medical applications. This paper will describe the recent developments of these devices and show how they have been applied. It also examines how haptic feedback has been combined with visual display devices, such as virtual reality walls and workbenches, in order to improve the immersive experience. ACM CSS: H.5.2 Information Interfaces and Presentation—Haptic I/O; I.3.8 Computer Graphics—Applications; I.6 Simulation and Modelling—Applications

The Scale Method for Blending Operations in Functionally‐Based Constructive Geometry

Abstract This paper presents a scale method for developing high dimensional scale functions to blend implicitly defined objects. Scale functions are differentiable on the entire domain except the origin, provide blending range control, and behave like Min/Max operators everywhere, so even a successive composition of blending operations containing overlapped blending regions can be generated smoothly. Because the scale method is a generalized method, implicit or parametric curves, such as cubic Bezier curves, rational conic curves, and implicit conics and hyper‐ellipsoids, can be used to develop scale functions. As a result, it can enhance the flexibility of generating the implicitly blending surfaces in Ricci's constructive geometry, soft objects modeling, and implicit sweep objects. ACM CSS: I.3.5 Computer Graphics—Computational Geometry and Object Modeling ‐ Curve, surface, solid and object representations

Progressive Hulls for Intersection Applications

Abstract Progressive meshes are an established tool for triangle mesh simplification. By suitably adapting the simplification process, progressive hulls can be generated which enclose the original mesh in gradually simpler, nested meshes. We couple progressive hulls with a selective refinement framework and use them in applications involving intersection queries on the mesh. We demonstrate that selectively refinable progressive hulls considerably speed up intersection queries by efficiently locating intersection points on the mesh. Concerning the progressive hull construction, we propose a new formula for assigning edge collapse priorities that significantly accelerates the simplification process, and enhance the existing algorithm with several conditions aimed at producing higher quality hulls. Using progressive hulls has the added advantage that they can be used instead of the enclosed object when a lower resolution of display can be tolerated, thus speeding up the rendering process. ACM CSS: I.3.3 Computer Graphics—Picture/Image Generation, I.3.5 Computer Graphics—Computational Geometry and Object Modeling, I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism

Efficient Modeling of An Anatomy‐Based Face and Fast 3D Facial Expression Synthesis

Abstract This paper presents new methods for efficient modeling and animation of an hierarchical facial model that conforms to the human face anatomy for realistic and fast 3D facial expression synthesis. The facial model has a skin–muscle–skull structure. The deformable skin model directly simulates the nonlinear visco‐elastic behavior of soft tissue and effectively prevents model collapse. The construction of facial muscles is achieved by using an efficient muscle mapping approach. Based on a cylindrical projection of the texture‐mapped facial surface and wire‐frame skin and skull meshes, this approach ensures different muscles to be located at the anatomically correct positions between the skin and skull layers. For computational efficiency, we devise an adaptive simulation algorithm which uses either a semi‐implicit integration scheme or a quasi‐static solver to compute the relaxation by traversing the designed data structures in a breadth‐first order. The algorithm runs in real‐time and has successfully synthesized realistic facial expressions. ACM CSS: I.3.5 Computer Graphics: Computational Geometry and Object Modelling—physically based modelling; I.3.7 Computer Graphics: Three‐Dimensional Graphics and Realism—animation;

Interactive Rendering of Translucent Objects†

Abstract This paper presents a rendering method for translucent objects, in which viewpoint and illumination can be modified at interactive rates. In a preprocessing step, the impulse response to incoming light impinging at each surface point is computed and stored in two different ways: The local effect on close‐by surface points is modeled as a per‐texel filter kernel that is applied to a texture map representing the incident illumination. The global response (i.e. light shining through the object) is stored as vertex‐to‐vertex throughput factors for the triangle mesh of the object. During rendering, the illumination map for the object is computed according to the current lighting situation and then filtered by the precomputed kernels. The illumination map is also used to derive the incident illumination on the vertices which is distributed via the vertex‐to‐vertex throughput factors to the other vertices. The final image is obtained by combining the local and global response. We demonstrate the performance of our method for several models. ACM CSS:I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism Color Radiosity

Real‐Time Consensus‐Based Scene Reconstruction Using Commodity Graphics Hardware†

Abstract We present a novel use of commodity graphics hardware that effectively combines a plane‐sweeping algorithm with view synthesis for real‐time, online 3D scene acquisition and view synthesis. Using real‐time imagery from a few calibrated cameras, our method can generate new images from nearby viewpoints, estimate a dense depth map from the current viewpoint, or create a textured triangular mesh. We can do each of these without any prior geometric information or requiring any user interaction, in real time and online. The heart of our method is to use programmable Pixel Shader technology to square intensity differences between reference image pixels, and then to choose final colors (or depths) that correspond to the minimum difference, i.e. the most consistent color. In this paper we describe the method, place it in the context of related work in computer graphics and computer vision, and present some results. ACM CSS: I.3.3 Computer Graphics—Bitmap and framebuffer operations, I.4.8 Image Processing and Computer Vision—Depth cues, Stereo

Approximating Parametric Curves With Strip Trees Using Affine Arithmetic

Abstract We show how to use affine arithmetic to represent a parametric curve with a strip tree. The required bounding rectangles for pieces of the curve are computed by exploiting the linear correlation information given by affine arithmetic. As an application, we show how to compute approximate distance fields for parametric curves. ACM CSS: I.3.3 Computer Graphics—Curve, surface, solid, and object representations, G.1.2 Numerical Analysis—Approximation of surfaces and contours, G.1.0 Numerical Analysis—Interval arithmetic

3D Video Recorder: a System for Recording and Playing Free‐Viewpoint Video†

Abstract We present the 3D Video Recorder, a system capable of recording, processing, and playing three‐dimensional video from multiple points of view. We first record 2D video streams from several synchronized digital video cameras and store pre‐processed images to disk. An off‐line processing stage converts these images into a time‐varying 3D hierarchical point‐based data structure and stores this 3D video to disk. We show how we can trade‐off 3D video quality with processing performance and devise efficient compression and coding schemes for our novel 3D video representation. A typical sequence is encoded at less than 7 Mbps at a frame rate of 8.5 frames per second. The 3D video player decodes and renders 3D videos from hard‐disk in real‐time, providing interaction features known from common video cassette recorders, like variable‐speed forward and reverse, and slow motion. 3D video playback can be enhanced with novel 3D video effects such as freeze‐and‐rotate and arbitrary scaling. The player builds upon point‐based rendering techniques and is thus capable of rendering high‐quality images in real‐time. Finally, we demonstrate the 3D Video Recorder on multiple real‐life video sequences. ACM CSS: I.3.2 Computer Graphics—Graphics Systems, I.3.5 Computer Graphics—Computational Geometry and Object Modelling, I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism

Automatic Hybrid Hierarchy Creation: a Cost‐model Based Approach

Abstract While using hierarchical search structures has been proved as one of the most efficient acceleration techniques when rendering complex scenes, automatic creation of appropriate hierarchies is not solved yet. Well‐known algorithms for automatic creation of bounding volume hierarchies are not enough. Higher performance is achieved by introducing spatial uniform subdivision, although algorithms proposed up to now are not truly automatic, as they need some parameters to be adjusted. In this paper we present a full‐automatic hierarchy creation scheme that structures the scene in a hybrid way, combining bounding volumes and voxel grids in the same tree, selecting the search structure that best fits to each scene region. It uses no parameters at all. This efficient proposal relies on a new cost model that estimates the goodness of a hybrid hierarchy if used for rendering the scene. ACM CSS: I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism

Two‐dimensional Potential Fields for Advanced Implicit Modeling Operators

Abstract Current methods for building models using implicit volume techniques present problems defining accurate and controllable blend shapes between implicit primitives. We present new methods to extend the freedom and controllability of implicit volume modeling. The main idea is to use a free‐form curve to define the profile of the blend region between implicit primitives. The use of a free‐form implicit curve, controlled point‐by‐point in the Euclidean user space, allows us to group boolean composition operators with sharp transitions or smooth free‐form transitions in a single modeling metaphor. This idea is generalized for the creation, sculpting and manipulation of volume objects, while providing the user with simplicity, controllability and freedom in implicit modeling. ACM CSS: I.3.5 Computational Gemoetry and Object Modeling—Curve, surface, solid, and object representations

Quad/Triangle Subdivision

Abstract In this paper we introduce a new subdivision operator that unifies triangular and quadrilateral subdivision schemes. Designers often want the added flexibility of having both quads and triangles in their models. It is also well known that triangle meshes generate poor limit surfaces when using a quad scheme, while quad‐only meshes behave poorly with triangular schemes. Our new scheme is a generalization of the well known Catmull‐Clark and Loop subdivision algorithms. We show that our surfaces are C 1 everywhere and provide a proof that it is impossible to construct such a C 2 scheme at the quad/triangle boundary. However, we provide rules that produce surfaces with bounded curvature at the regular quad/triangle boundary and provide optimal masks that minimize the curvature divergence elsewhere. We demonstrate the visual quality of our surfaces with several examples. ACM CSS: I.3.5 Computer Graphics—Curve, surface, solid, and object representations

State of the Art in Global Illumination for Interactive Applications and High‐quality Animations

Abstract Global illumination algorithms are regarded as computationally intensive. This cost is a practical problem when producing animations or when interactions with complex models are required. Several algorithms have been proposed to address this issue. Roughly, two families of methods can be distinguished. The first one aims at providing interactive feedback for lighting design applications. The second one gives higher priority to the quality of results, and therefore relies on offline computations. Recently, impressive advances have been made in both categories. In this report, we present a survey and classification of the most up‐to‐date of these methods. ACM CSS: I.3.7 Computer Graphics—Three‐Dimensional Graphics and Realism