Issue 2
Permanent URI for this collection
Browse
Browsing Issue 2 by Issue Date
Now showing 1 - 12 of 12
Results Per Page
Sort Options
Item Editorial(Blackwell Publishers Ltd and the Eurographics Association, 2002)Item Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method(Blackwell Publishers Ltd and the Eurographics Association, 2002) Samavati, Faramarz; Mahdavi-Amiri, Nezam; Bartels, RichardWe have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models (Samavati and Bartels, Computer Graphics Forum, 18(2):97-119, June 1999). As a result, semiorthogonal wavelet systems have also been generated. To construct a multiresolution surface of an arbitrary topology, however, biorthogonal wavelets are needed. In Bartels and Samavati (Journal of Computational and Applied Mathematics, 119:29-67, 2000) we introduced local least squares models for reversing subdivision rules to construct multiresolution curves and tensor product surfaces, noticing that the resulting wavelets were biorthogonal (under an induced inner product). Here, we construct multiresolution surfaces of arbitrary topologies by locally reversing the Doo subdivision scheme. In a Doo subdivision, a coarse surface is converted into a fine one by the contraction of coarse faces and the addition of new adjoining faces. We propose a novel reversing process to convert a fine surface into a coarse one plus an error. The conversion has the property that the subdivision of the resulting coarse surface is locally closest to the original fine surface, in the least squares sense, for two important face geometries. In this process, we first find those faces of the fine surface which might have been produced by the contraction of a coarse face in a Doo subdivision scheme. Then, we expand these faces. Since the expanded faces are not necessarily joined properly, several candidates are usually at hand for a single vertex of the coarse surface. To identify the set of candidates corresponding to a vertex, we construct a graph in such a way that any set of candidates corresponds to a connected component. The connected components can easily be identified by a depth first search traversal of the graph. Finally, vertices of the coarse surface are set to be the average of their corresponding candidates, and this is shown to be equivalent to local least squares approximation for regular arrangements of triangular and quadrilateral faces.Item 3rd Eurographics Workshop on Parallel Graphics and Visualization(Blackwell Publishers Ltd and the Eurographics Association, 2002)Item Book Reviews(Blackwell Publishers Ltd and the Eurographics Association, 2002) Howard, TobyItem Recent Advances in Mesh Morphing(Blackwell Publishers Ltd and the Eurographics Association, 2002) Alexa, MarcMeshes have become a widespread and popular representation of models in computer graphics. Morphing techniques aim at transforming a given source shape into a target shape. Morphing techniques have various applications ranging from special effects in television and movies to medical imaging and scientific visualization. Not surprisingly, morphing techniques for meshes have received a lot of interest lately.This work sums up recent developments in the area of mesh morphing. It presents a consistent framework to classify and compare various techniques approaching the same underlying problems from different angles.Item An Adaptive Sampling Scheme for Out-of-Core Simplification(Blackwell Publishers Ltd and the Eurographics Association, 2002) Fei, Guangzheng; Cai, Kangying; Guo, Baining; Wu, EnhuaCurrent out-of-core simplification algorithms can efficiently simplify large models that are too complex to be loaded in to the main memory at one time. However, these algorithms do not preserve surface details well since adaptive sampling, a typical strategy for detail preservation, remains to be an open issue for out-of-core simplification. In this paper, we present an adaptive sampling scheme, called the balanced retriangulation (BR), for out-of-core simplification. A key idea behind BR is that we can use Garland's quadric error matrix to analyze the global distribution of surface details. Based on this analysis, a local retriangulation achieves adaptive sampling by restoring detailed areas with cell split operations while further simplifying smooth areas with edge collapse operations. For a given triangle budget, BR preserves surface details significantly better than uniform sampling algorithms such as uniform clustering. Like uniform clustering, our algorithm has linear running time and small memory requirement.Item The 3D Model Acquisition Pipeline(Blackwell Publishers Ltd and the Eurographics Association, 2002) Bernardini, Fausto; Rushmeier, HollyThree-dimensional (3D) image acquisition systems are rapidly becoming more affordable, especially systems based on commodity electronic cameras. At the same time, personal computers with graphics hardware capable of displaying complex 3D models are also becoming inexpensive enough to be available to a large population. As a result, there is potentially an opportunity to consider new virtual reality applications as diverse as cultural heritage and retail sales that will allow people to view realistic 3D objects on home computers.Although there are many physical techniques for acquiring 3D data-including laser scanners, structured light and time-of-flight-there is a basic pipeline of operations for taking the acquired data and producing a usable numerical model. We look at the fundamental problems of range image registration, line-of-sight errors, mesh integration, surface detail and color, and texture mapping. In the area of registration we consider both the problems of finding an initial global alignment using manual and automatic means, and refining this alignment with variations of the Iterative Closest Point methods. To account for scanner line-of-sight errors we compare several averaging approaches. In the area of mesh integration, that is finding a single mesh joining the data from all scans, we compare various methods for computing interpolating and approximating surfaces. We then look at various ways in which surface properties such as color (more properly, spectral reflectance) can be extracted from acquired imagery. Finally, we examine techniques for producing a final model representation that can be efficiently rendered using graphics hardware.Item 6th Eurographics Workshop on Multimedia(Blackwell Publishers Ltd and the Eurographics Association, 2002)Item Join Now!/Network Service(2002)Item 12th Eurographics Workshop on Rendering(Blackwell Publishers Ltd and the Eurographics Association, 2002)Item Artistic Surface Rendering Using Layout of Text(Blackwell Publishers Ltd and the Eurographics Association, 2002) Surazhsky, Tatiana; Elber, GershonAn artistic rendering method of free-form surfaces with the aid of half-toned text that is laid-out on the given surface is presented. The layout of the text is computed using symbolic composition of the free-form parametric surface S(u, v) with cubic or linear Bezier curve segments C(t) = cu (t), cv (t), comprising the outline of the text symbols. Once the layout is constructed on the surface, a shading process is applied to the text, affecting the width of the symbols as well as their color, according to some shader function. The shader function depends on the surface orientation and the view direction as well as the color and the direction or position of the light source.Item Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes(Blackwell Publishers Ltd and the Eurographics Association, 2002) Bogomjakov, A.; Gotsman, C.We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex reuse when rendering the mesh using a FIFO vertex buffer, such as those available in modern 3D graphics hardware. The sequences are universal in the sense that they perform well for all sizes of vertex buffers, and generalize to progressive meshes. This has been verified experimentally.