EG 1996 Conference Proceedings
Permanent URI for this collection
Browse
Browsing EG 1996 Conference Proceedings by Title
Now showing 1 - 20 of 42
Results Per Page
Sort Options
Item 3D Interactive Topological Modeling using Visible Human Dataset(Blackwell Science Ltd and the Eurographics Association, 1996) Beylot, P; Gingins, P; Kalra, P; Thalmann, N Magnenat; Maurel, W; Thalmann, D; Fasel, JAvailability of Visible Human Dataset (VHD)has provided numerous possibilities for its exploitation in both medical applications and 3D animation. In this paper, we present our interactive tools which enable extraction of surfaces for different organs, including bones, muscles, fascia, and skin, from the VHD. The reconstructed surfaces then are used for defining the inter-relationship of organs, a process we refer to as topological modeling. A data base is constructed, which encapsulates structural, topological, mechanical and other relevant information about organs. A 3D interactive tool enables the building and editing of this data base. Such a data base can later be used for different applications in fields such as medicine, sports, education, and entertainment.Item 3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi Diagram(Blackwell Science Ltd and the Eurographics Association, 1996) Oliva, J-M.; Perrin, M.; Coquillart, S.We are interested in modelling the suface of very irregular objects known through a few planar polygonal cross-sections. This problem is considered difficult when severe topology and morphology variations appear between neighbouring cross-sections (multi-branching, holes, disconnected areas). Only few methods deal with this problem in a systematic way.The paper describes an original method allowing to build, in a fully automatic and systematic way, an external surface with a valid topology in any case. It moreover allows to adjust details of the reconstructed surface in view of the morphologies and topologies of the various initial cross-sectional contours.At first, a global correspondence is operated between each couple of adjacent cross-sections by extracting polygonal areas of difference. Next steps are based on the computation in each area of difference of the bisector network, a well-defined simplified generalised Voronoi diagram. This structure is used both for connecting initial contour points and for interpolating new intermediate portions of contours. It depends on the complexity of initial 2D shapes. Interpolation stage is then recursively operated until a satisfactory surface has been obtained or until a maximum number of new intermediate cross-sectional contours have been built. The valid final suface is directly obtained by concatenating all the tiling areas of difference without need of any post processing step. The processing of several real data related to geological bodies or human organs has proved that the described method allows detailed modelling of irregular objects with very performing CPU times. The reconstruction appears insensitive to severe variations of the object shape, including apparitions of holes or disconnections.Item Automatic Generation of Multiresolution Boundary Representations(Blackwell Science Ltd and the Eurographics Association, 1996) Andujar, C.; Ayala, D.; Brunet, P.; Arinyo, R. Joan; Sole, J.The paper focuses on automatic simplification algorithms for the generation of a multiresolution family of solid models from an initial boundary representation of a polyhedral solid. An algorithm for general polyhedra based on an intermediate octree representation is proposed. Simplified elements of the multiresolution family approximate the initial solid within increasing tolerances. A discussion among different octree-based simplification methods and the standard marching cubes algorithm is presented.Item Blob Metamorphosis based on Minkowski Sums(Blackwell Science Ltd and the Eurographics Association, 1996) Galin, E.; Akkouche, S.This paper addresses the metamorphosis of soft objects built from skeletons. We propose a new approach that may be split into three steps. The first step consists in an original splitting of the initial and the final shapes with a view to creating a bijective graph of correspondence. In the second step, we assume that the skeletons are convex polygonal shapes, and thus take advantage of the properties of Minkowski sums to characterize the skeletons of intermediate shapes. Eventually, we characterize the intermediate distance and field functions- we describe a set of interpolation methods and propose to use a restricted class of parametrized distance and field functions so as to preserve coherence and speed-up computations.We show that we can easily extend those results to achieve a Bezier like metamorphosis where control points are replaced by control soft objects- in this scope, we have adapted existing accelerated techniques that build a Bezier transformation from a set of convex polyhedra to any kind of convex polygonal shapes.Eventually, we point out that matching all components of the initial and the final shapes generates amorphous intermediate shapes based on an overwhelming number of intermediate sub-components. Thus, we propose heuristics with a view to preserving coherence during the transformation and accelerating computations. We have implemented and tested our techniques in an experimental ray-tracer.Item BOXTREE: A Hierarchical Representation for Surfaces in 3D(Blackwell Science Ltd and the Eurographics Association, 1996) Barequet, Gill; Chazelle, Bernard; Guibas, Leonidas J.; Mitchell, Joseph S.B.; Tal, AyelletWe introduce the boxtree, a versatile data structure for representing triangulated or meshed surfaces in 3D. A boxtree is a hierarchical structure of nested boxes that supports efficient ray tracing and collision detection. It is simple and robust, and requires minimal space. In situations where storage is at a premium, boxtrees are effective alternatives to octrees and BSP trees. They are also more flexible and efficient than R-trees, and nearly as simple to implement.Item CCD-Camera Based Optical Beacon Tracking for Virtual and Augmented Reality(Blackwell Science Ltd and the Eurographics Association, 1996) Madritsch, Franz; Gervautz, MichaelWe introduce a scheme for optical beacon tracking using two CCD-cameras and LED beacons. Due to the sub-pixel accuracy of the beacon detection algorithm a very high precision can be achieved so that the tracking method is suitable for augmented reality applications. We describe the assembly of the equipment needed for the whole tracking system, the behavior of LED-beacons, and how three beacons can be combined to form a 6-DOF tracker. A report on our accuracy evaluation and its results are given. Furthermore we describe two application prototypes in which the tracker was incorporated and tested.Item Compositing Computer and Video Image Sequences: Robust Algorithms for the Reconstruction of the Camera Parameters(Blackwell Science Ltd and the Eurographics Association, 1996) Berger, M.-O.; Chevrier, C.; Simon, G.Augmented reality shows great promises in fields where a simulation in situ would be impossible or too expensive. When mixing synthetic and real objects in the same animated sequence, we must be sure that the geometrical coherence as well as the photometrical coherence is ensured. One major challenge is to compute the camera viewpoint with sufficient accuracy to ensure a satisfactory composition. We especially address this point in this paper using computer vision techniques and robust statistical methods. We prove that such techniques make it possible to compute almost automatically the viewpoint for long video sequences even for bad quality images in outdoor environments. Significant results on the lighting simulation of the bridges of Paris are shown.Item Computation of Higher Order Illumination with a Non-Deterministic Approach(Blackwell Science Ltd and the Eurographics Association, 1996) Bouatouch, Kadi; Pattanaik, S. N.; Zeghers, EricIn spite of the number of efforts made by the computer graphics researchers, till today the computation of view-independent global illumination in an environment containing non-diffusely reflecting objects is a non-resolved problem. In general, non-deterministic techniques seem to be capable of solving this problem. In this article we propose one such non-deterministic method which will permit such calculation by using a combined technique of higher order function approximation and particle tracing. We have used multi-wavelets as basis functions and have calculated the illumination function approximation coefficients by exploiting the adjointness between the radiance equation and the potential equation.Item Data Dependent Thin Plate Energy and its use in Interactive Surface Modeling(Blackwell Science Ltd and the Eurographics Association, 1996) Greiner, Gunther; Loos, Joachim; Wesselink, WiegerWhen modeling spline surfaces of complex shape, one has to deal with an overwhelming number of control points. Modeling by direct manipulation of the control points is a tedious task. In particular, it is very difficult to maintain a generally pleasant looking surface shape. It becomes therefore increasingly important to build tools that allow the designer to specify only a few geometric constraints while automatically determining the explicit representation of the surface. The basic concept of such a tool is simple. In a first step one has to somehow measure the"fairness" (=quality) of a surface. Once this is achieved, an optimization process selects the one surface with optimal fairness from all surfaces satisfying the user specified geometric constraints.To measure the fairness, thin plate energy functionals are a good choice. However, for interactive use these functionals are far too complex. W e will present appropriate approximations to these functionals that allow an optimization nearly in real time. Thefunctionals are obtained by introducing reference surfaces thus leading to data dependent, quadratic approximations to the exact thin plate energy functionals. We apply the method to interactive surface manipulations based on energy constraints.Item Demand-Driven Geometry Transmission for Distributed Virtual Environments(Blackwell Science Ltd and the Eurographics Association, 1996) Schmalstieg, Dieter; Gervautz, MichaelWe present a strategy for rendering in distributed virtual environments. A geometry database is maintained by a server, while users invoke individual clients to interact with the environment. Instead of downloading a complete copy of the geometry data, the data is distributed on demand, thus gaining signifcant savings in network bandwidth. Our strategy combines several techniques, including levels of detail, progressive refinement and graceful degradation to deliver the data"just in time" over the network to the rendering process. The method allows operate on a tight resource budget, which important if attempting to use low cost systems for virtual reality applications.Item An Energy-Based Approach for Contact Force Computation(Blackwell Science Ltd and the Eurographics Association, 1996) Faure, FrancoisA new approach for computing resting contact forces between solids is presented, which handles both static and sliding friction, while avoiding the problems arising from previous approaches. Each iteration provides values for all unknowns and needs a constant computation time. The first iteration is a global dynamic solution involving inertia and external forces. The subsequent iterations consist of global redistributions of energy through the solids in order to restrict the values within correct bounds, leading to a progressive refinement of the solution. This allows the termination of the computation when a user-defined level of precision is reached. Convergence is proven in the frictionless case.The method is concise and is easily usable in a motion control system. It was implemented and tested on some examples involving simultaneously static and sliding friction along with motion control.Item Extraction of Typographic Elements from Outline Representations of Fonts(Blackwell Science Ltd and the Eurographics Association, 1996) Shainir, Ariel; Rappoport, AriDigital typefaces for computer graphics and multimedia applications should be capable of supporting operations such as font variations, transformations. deformations and blending. A powerful implementation of such operations must rely on the inherent typographic attributes of the typeface. However, even today s most advanced typeface representations support only geometric outline representations and basic font variations.In this paper we discuss high-level typeface representations which we term Parametric Typographic Representations (PTRs). We present an algorithm for automatically extracting typographic elements of typefaces from their outline representation, which, is an essential initial step in converting typefaces from outline representations to PTRs. The extracted typographic elements include serifs, bars. sterns, slants, bows, arcs, curve stems and curve bars. Most notable is the treatment of serifs, which are represented by finite-automata. The algorithm only needs to learn a serif type once, and is then capable of automatically recognizing it in different typefaces.We show an application of a PTR for automatic high-quality hinting of fonts, which is one of the most important stages in, digital font production. Our system was used to generate hints for dozens of thousands of Kanji, Roman and Hebrew characters.Item Fractal modeling using free form techniques(Blackwell Science Ltd and the Eurographics Association, 1996) Zair, Chems Eddine; Tosan, EricIFS models have become a powerful tool for the construction of fractal sets. They offer a straightforward way to generate complex, self-similar figures as attractors. However, they present the fundamental disadvantage of providing little control over the global form of the attractor. In contrast, free form techniques give a high control over smooth man-made objects with the use of a set of control points.In this paper, we present a new approach of fractal modeling which is based on IFS theory. We shall use free form techniques to give a practical and efficient way to build controlled fractal attractors. The resulting effect consists on the ability to deform a fractal shape interactively into the desired shape, in the same way as parametric forms (Bezier, splines).Item Full-range approximation of triangulated polyhedra.(Blackwell Science Ltd and the Eurographics Association, 1996) Ronfard, Remi; Rossignac, JarekWe propose a new algorithm for automatically computing approximations of a given polyhedral object at different levels of details. The application for this algorithm is the display of very complex scenes. where many objects are seen with a range of varying levels of detail. Our approach is similar to the region-merging method used for image segmentation. We iteratively collapse edges, based on a measure of the geometric deviation from the initial shape. When edges are merged in the right order, this strategy produces a continuum of valid approximations of the original object, which can be used for faster rendering at vastly different scales.Item Generation of 3D Texture Using Multiple 2D Models Analysis(Blackwell Science Ltd and the Eurographics Association, 1996) GHAZANFARPOUR, Djamchid; DISCHLER, Jean-MichelSolid (30) texturing is commonly used in computer graphics for producing more realistic images. It is often more attractive than the conventional 20 texture mapping but remains more complex on some points. Its major difficulty concerns the generation of 30 texture in a general and efficient way. The well-known traditional procedural methods use generally a simplified mathematical model of a natural texture. No reliable way for the choice of the mathematical model parameters, which characterise directly the produced 30 texture, is given. Therefore, 30 texture generation becomes a more or less experimental process with these methods.Our recently published methodfor an automatic 30 texture generation avoids this problem by the use of the spectral analysis of one 2D model texture. The resulting 30 texture is of good quality but one open problem remains: the aspect of the produced texture cannot be fully controlled over the entire 30 space by only one 20 spectral analysis. This may be considered as a serious limitation for some kinds of textures representing important variations in any direction.In this paper we present a new and more powerful analytical approach for an automatic 30 texture generation. Contrarily to our previous method, this new approach is not exclusively based on the spectral analysis of only one 20 model. It uses two or three 2D models corresponding to different slices of a 30 texture block, so, the aspect of the produced 3D texture can be controlled more efficiently over the entire 30 space. In addition, a more efficient 30 texture antialiasing, well adapted to this new method is presented.Item Generation of Smooth Surfaces by Controlling Curvature Variation(Blackwell Science Ltd and the Eurographics Association, 1996) Higashi, Masatake; Tsutamori, Hideo; Hosaka, MamoruTo satisfy a designer s intention for constructing aesthetic shapes such as automotive bodies, we propose a surface generation method. In the surface design process, designers determine shapes according to their great concern for the reflected images of vehicle surroundings, shade lines and highlight lines. Since reflection and shading are affected by changes of surface normal, the curvature variation of the surface, which represents the change of the surface normal, should be smooth and distributed as designers want. The proposed method controls curvature distribution directly by determining a surface shape from an evolute, which is a locus of the curvature center of the generatrix and moves along directrices to form the surface. It first generates evolutes of boundary curves to be generatrices as rational Bezier curves, then interpolates their shapes with the Bezier polygons, and locates the interpolated shape to the corresponding position of the directrices. By applying this method, we have confirmed that a smooth shape is generated from four boundary curves.Item Head-Tracked Stereo Viewing with Two-Handed 3 D Interaction for Animated Character Construction(Blackwell Science Ltd and the Eurographics Association, 1996) Turner, Russell; Gobbetti, Enrico; Soboroff, IanIn this paper, we demonstrate how a new interactive 3 D desktop metaphor based on two-handed 3 D direct manipulation registered with head-tracked stereo viewing can be applied to the task of constructing animated characters. In our configuration, a six degree-of-freedom head-tracker and CrystalEyes shutter glasses are used to produce stereo images that dynamically follow the user head motion. 3 D virtual objects can be made to appear at a fixed location in physical space which the user may view from different angles by moving his head. To construct 3 D animated characters, the user interacts with the simulated environment using both hands simultaneously: the left hand, controlling a Spaceball, is used for 3 D navigation and object movement, while the right hand, holding a 3 D mouse, is used to manipulate through a virtual tool metaphor the objects appearing in front of the screen. In this way, both incremental and absolute interactive input techniques are provided by the system. Hand-eye coordination is made possible by registering virtual space exactly to physical space, allowing a variety of complex 3 D tasks necessary for constructing 3 D animated characters to be performed more easily and more rapidly than is possible using traditional interactive techniques. The system has been tested using both Polhemus Fastrak and Logitech ultrasonic input devices for tracking the head and 3 D mouse.Item An Image based Measurement System for Anisotropic Reflection(Blackwell Science Ltd and the Eurographics Association, 1996) Karner, Konrad F.; Mayer, Heinz; Gervautz, MichaelThis paper introduces an image based method for measuring bidirectional reflectance distribution functions (BRDF). The measurement system uses a CCD camera connected to a workstation to capture images from the material under investigation. The evaluation of the BRDF is performed in an image processing step, gathering BRDF values with a broad range of incident and reflected angles, followed by a fitting process, where these values are approximated by a chosen reflectance model. Absolute BRDF values are obtained by the usage of a diffuse reflectance standard. It is shown that the proposed measurement system produces very reasonable results compared to accurate measurements. Thus, it is an easy and cost efficient way to measure material properties needed for physically based rendering algorithms.Item Implicit Sweep Objects(Blackwell Science Ltd and the Eurographics Association, 1996) Crespin, Benoit; Blanc, Carole; Schlick, ChristopheItem Incremental constraint modelling in a feature modelling system(Blackwell Science Ltd and the Eurographics Association, 1996) Laakko, Timo; Mantyla, MarttiThe techniques of constraint propagation have recently been successfully applied to feature-based design. Because of their speed, constraint propagation methods allow incremental design and rapid local modifcations of the part. However, cyclic constraints cause serious problems to current constraint propagation algorithms. Variational geometric design systems can, in principle, manage these cases. Unfortunately, this typically requires complete re-evaluation of the underlying set of constraint equations, making the method unsuitable for interactive use.The proposed system aims to localize the problem of constraint solving and maintenance. The constraint graph of the part or assembly is divided into several independent partial graphs, subsystems. Afterwards, each subsystem is handled separately using a selected constraint solving technique for the subsystem.