Now showing items 1-20 of 89

    • Accelerating Volume Raycasting using Occlusion Frustums 

      Mensmann, Jörg; Ropinski, Timo; Hinrichs, Klaus (The Eurographics Association, 2008)
      GPU-based volume raycasting allows to produce high quality renderings on current graphics hardware. The use of such raycasters is on the rise due to their inherent flexibility as well as the advances in hardware performance ...
    • Adaptive Sampling and Rendering of Fluids on the GPU 

      Zhang, Yanci; Solenthaler, Barbara; Pajarola, Renato (The Eurographics Association, 2008)
      In this paper, we propose a novel GPU-friendly algorithm for the Smoothed Particle Hydrodynamics (SPH) simulation for weakly compressible fluids. The major goal of our algorithm is to implement a GPU-based SPH simulation ...
    • Approximate Star-Shaped Decomposition of Point Set Data 

      Lien, Jyh-Ming (The Eurographics Association, 2007)
      Simplification or decomposition is a common strategy to handle large geometric models, which otherwise require excessive computation to process. Star-shaped decomposition partitions a model into a set of star-shaped ...
    • Approximating Geodesics on Point Set Surfaces 

      Ruggeri, Mauro R.; Darom, Tal; Saupe, Dietmar; Kiryati, Nahum (The Eurographics Association, 2006)
      We present a technique for computing piecewise linear approximations of geodesics on point set surfaces by minimizing an energy function defined for piecewise linear path. The function considers path length, closeness to ...
    • A Barcode Shape Descriptor for Curve Point Cloud Data 

      Collins, Anne; Zomorodian, Afra; Carlsson, Gunnar; Guibas, Leonidas (The Eurographics Association, 2004)
      In this paper, we present a complete computational pipeline for extracting a compact shape descriptor for curve point cloud data. Our shape descriptor, called a barcode, is based on a blend of techniques from differential ...
    • Boolean Operations on Surfel-Bounded Solids Using Programmable Graphics Hardware 

      Adams, Bart; Dutré, Philip (The Eurographics Association, 2004)
      In this paper we present an algorithm to compute boolean operations on free-form solids bounded by surfels using programmable graphics hardware. The intersection, union and difference of two or more solids, is calculated ...
    • Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces 

      Andersson, Mattias; Giesen, Joachim; Pauly, Mark; Speckmann, Bettina (The Eurographics Association, 2004)
      Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all ...
    • Compression of Point-Based 3D Models by Shape-Adaptive Wavelet Coding of Multi-Height Fields 

      Ochotta, Tilo; Saupe, Dietmar (The Eurographics Association, 2004)
      In order to efficiently archive and transmit large 3D models, lossy and lossless compression methods are needed. We propose a compression scheme for coordinate data of point-based 3D models of surfaces. A point-based model ...
    • Computing Variation Modes for Point Set Surfaces 

      Miao, Lanfang; Huang, Jin; Liu, Xinguo; Bao, Hujun; Peng, Qunsheng; Guo, Baining (The Eurographics Association, 2005)
      Point sets have become a popular shape representation. In this paper, we present a novel approach to computing variation modes for point set surfaces, and represent the point set surface as a linear combination of the ...
    • Conformal Alpha Shapes 

      Cazals, Frederic; Giesen, Joachim; Pauly, Mark; Zomorodian, Afra (The Eurographics Association, 2005)
      We define a new filtration of the Delaunay triangulation of a finite set of points in Rd, similar to the alpha shape filtration. The new filtration is parameterized by a local scale parameter instead of the global scale ...
    • Conversion of Point-Sampled Models to Textured Meshes 

      Wicke, Martin; Olibet, Sandro; Gross, Markus (The Eurographics Association, 2005)
      We present an algorithm to convert point-sampled objects to textured meshes. The output mesh carries the geometric information present in the input model, while information about color and other surface attributes is ...
    • Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors 

      Neeman, Alisa G.; Brannon, Rebecca; Jeremic, Boris; Gelder, Allen Van; Pang, Alex (The Eurographics Association, 2008)
      Visualization of fourth-order tensors from solid mechanics has not been explored in depth previously. Challenges include the large number of components (3x3x3x3 for 3D), loss of major symmetry and loss of positive definiteness ...
    • Direct Computing of Surface Curvatures for Point-Set Surfaces 

      Yang, Pinghai; Qian, Xiaoping (The Eurographics Association, 2007)
      Accurate computing of the curvatures of a surface from its discrete form is of fundamental importance for many graphics and engineering applications. The moving least-squares (MLS) surface from Levin [Lev2003] and its ...
    • The Domain of a Point Set Surface 

      Amenta, Nina; Kil, Yong J. (The Eurographics Association, 2004)
      It is useful to be able to define a two-dimensional point-set surface determined by a point cloud. One popular definition is Levin's MLS surface. This surface is defined on a domain which is a three-dimensional subset of ...
    • DUODECIM - A Structure for Point Scan Compression and Rendering 

      Krüger, Jens; Schneider, Jens; Westermann, Rüdiger (The Eurographics Association, 2005)
      In this paper we present a compression scheme for large point scans including per-point normals. For the encoding of such scans we introduce a particular type of closest sphere packing grids, the hexagonal close packing ...
    • A Dynamic Surface Reconstruction Framework for Large Unstructured Point Sets 

      Allègre, Rémi; Chaine, Raphaëlle; Akkouche, Samir (The Eurographics Association, 2006)
      We present a method to reconstruct simplified mesh surfaces from large unstructured point sets, extending recent work on dynamic surface reconstruction. The method consists of two core components: an efficient selective ...
    • Efficient and Prioritized Point Subsampling for CSRBF Compression 

      Kitago, Masaki; Gopi, M. (The Eurographics Association, 2006)
      We present a novel cost function to prioritize points and subsample a point set based on the dominant geometric features and local sampling density of the model. This cost function is easy to compute and at the same time ...
    • Efficient Bounds for Point-Based Animations 

      Steinemann, Denis; Otaduy, Miguel A.; Gross, Markus (The Eurographics Association, 2007)
      We introduce a new and efficient approach for collision detection in point-based animations, based on the fast computation of tight surface bounds. Our approach is able to tightly bound a high-resolution surface with a ...
    • Efficient Point-Based Rendering Using Image Reconstruction 

      Marroquim, Ricardo; Kraus, Martin; Cavalcanti, Paulo Roma (The Eurographics Association, 2007)
      Image-space reconstruction of continuous surfaces from scattered one-pixel projections of points is known to potentially offer an advantageous time complexity compared to surface splatting techniques. We propose a new ...
    • Efficient Refinement of Dynamic Point Data 

      Solenthaler, Barbara; Zhang, Yanci; Pajarola, Renato (The Eurographics Association, 2007)
      Particle simulations as well as geometric modeling techniques have demonstrated their ability to process and render points interactively. However, real-time particle-based fluid simulations suffer from poor rendering quality ...