4 results
Search Results
Now showing 1 - 4 of 4
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 Directional Discretized Occluders for Accelerated Occlusion Culling(Blackwell Publishers Ltd and the Eurographics Association, 2000) Bernardini, Fausto; Klosowski, James T.; El-Sana, JihadWe present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure and compute simple view-dependent polygonal occluders to replace the complex input geometry in subsequent visibility queries. When the user is inspecting and visualizing the input model, the computed occluders are used to avoid rendering geometry which cannot be seen. Our method has several advantages which allow it to perform conservative visibility queries efficiently and it does not require any special graphics hardware. The preprocessing step of our approach can also be used within the framework of other visibility culling methods which need to pre-select or pre-render occluders. In this paper, we describe our technique and its implementation in detail, and provide experimental evidence of its performance. In addition, we briefly discuss possible extensions of our algorithm.Item Horizon Map Capture(Blackwell Publishers Ltd and the Eurographics Association, 2001) Rushmeier, Holly; Balmelli, Laurent; Bernardini, FaustoWe present a method for computing horizon maps from captured images of a bumpy surface. 1Horizon maps encode surface self-shadowing effects, and can be used with bump or normals maps to realistically render surfaces with small height perturbations. The method does not rely on complete surface reconstruction, and requires only eight captured images as input. In this paper we discuss how shadow information is extrapolated from the eight captured images to compute the horizon map. Our implementation accounts for the noise and uncertainties in physically acquired data.Item Space-Optimized Texture Maps(Blackwell Publishers, Inc and the Eurographics Association, 2002) Balmelli, Laurent; Taubin, Gabriel; Bernardini, FaustoTexture mapping is a common operation to increase the realism of three-dimensional meshes at low cost. We propose a new texture optimization algorithm based on the reduction of the physical space allotted to the texture image. Our algorithm optimizes the use of texture space by computing a warping function for the image and new texture coordinates. Neither the mesh geometry nor its connectivity are modified by the optimization. Our method uniformly distributes frequency content of the image in the spatial domain. In other words, the image is stretched in high frequency areas, whereas low frequency regions are shrunk. We also take into account distortions introduced by the mapping onto the model geometry in this process. The resulting image can be resampled at lower rate while preserving its original details. The unwarping is performed by the texture mapping function. Hence, the space-optimized texture is stored as-is in texture memory and is fully supported by current graphics hardware. We present several examples showing that our method significantly decreases texture memory usage without noticeable loss in visual quality.