Browsing SGP05: Eurographics Symposium on Geometry Processing by Issue Date

Now showing items 1-20 of 25

    • Surface Reconstruction for Noisy Point Clouds 

      Mederos, Boris; Amenta, Nina; Velho, Luiz; Figueiredo, Luiz Henrique de (The Eurographics Association, 2005)
      We show that a simple modification of the power crust algorithm for surface reconstruction produces correct outputs in presence of noise. This is proved using a fairly realistic noise model. Our theoretical results are ...

    • Streaming Compression of Triangle Meshes 

      Isenburg, Martin; Lindstrom, Peter; Snoeyink, Jack (The Eurographics Association, 2005)
      Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabyte-sized mesh input where the construction and the ...

    • Reconstruction of Solid Models from Oriented Point Sets 

      Kazhdan, Michael (The Eurographics Association, 2005)
      In this paper we present a novel approach to the surface reconstruction problem that takes as its input an oriented point set and returns a solid, water-tight model. The idea of our approach is to use Stokes' Theorem to ...

    • Discrete Willmore Flow 

      Bobenko, Alexander I.; Schröder, Peter (The Eurographics Association, 2005)
      The Willmore energy of a surface, R(H2 -K)dA, as a function of mean and Gaussian curvature, captures the deviation of a surface from (local) sphericity. As such this energy and its associated gradient flow play an important ...

    • An Image Processing Approach to Surface Matching 

      Litke, Nathan; Droske, Marc; Rumpf, Martin; Schröder, Peter (The Eurographics Association, 2005)
      Establishing a correspondence between two surfaces is a basic ingredient in many geometry processing applications. Existing approaches, which attempt to match two meshes directly in 3D, can be cumbersome to implement and ...

    • Template-Based Mesh Completion 

      Kraevoy, Vladislav; Sheffer, Alla (The Eurographics Association, 2005)
      Meshes generated by range scanners and other acquisition tools are often incomplete and typically contain multiple connected components with irregular boundaries and complex holes. This paper introduces a robust algorithm ...

    • Triangulating Point Set Surfaces with Bounded Error 

      Scheidegger, Carlos E.; Fleishman, Shachar; Silva, Claudio T. (The Eurographics Association, 2005)
      We introduce an algorithm for constructing a high-quality triangulation directly from Point Set Surfaces. Our algorithm requires no intermediate representation and no post-processing of the output, and naturally handles ...

    • Progressive Buffers: View-dependent Geometry and Texture for LOD Rendering 

      Sander, Pedro V.; Mitchell, Jason L. (The Eurographics Association, 2005)
      We introduce a view-dependent level of detail rendering system designed with modern GPU architectures in mind. Our approach keeps the data in static buffers and geomorphs between different LODs using per-vertex weights for ...

    • Setting the Boundary Free: A Composite Approach to Surface Parameterization 

      Zayer, Rhaleb; Rössl, Christian; Seidel, Hans-Peter (The Eurographics Association, 2005)
      In the last decade, surface mesh parameterization has emerged as a standard technique in computer graphics. The ever increasing need for processing large and highly detailed data sets fosters the development of efficient ...

    • A Geometric Construction of Coordinates for Convex Polyhedra using Polar Duals 

      Ju, Tao; Schaefer, Scott; Warren, Joe; Desbrun, Mathieu (The Eurographics Association, 2005)
      A fundamental problem in geometry processing is that of expressing a point inside a convex polyhedron as a combination of the vertices of the polyhedron. Instances of this problem arise often in mesh parameterization and ...

    • Modeling with Simplicial Diffeomorphisms 

      Velho, Luiz (The Eurographics Association, 2005)
      In this paper we introduce a new framework for geometric modeling that combines implicit and parametric surface representations with volumetric warpings. The framework is based on dynamic, adaptive simplicial decompositions ...

    • Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold 

      Krishnan, Shankar; Lee, Pei Yean; Moore, John B.; Venkatasubramanian, Suresh (The Eurographics Association, 2005)
      We propose a novel algorithm to register multiple 3D point sets within a common reference frame using a manifold optimization approach. The point sets are obtained with multiple laser scanners or a mobile scanner. Unlike ...

    • Swept Volumes of many Poses 

      Wallner, Johannes; Yang, Qinmin (The Eurographics Association, 2005)
      We consider the swept volume A(X) of a rigid body X which assumes a general set A of positions. A special case of this is a one-parameter motion of X, where the set of poses is curve-like. Here we consider a full-dimensional ...

    • Multiscale Features for Approximate Alignment of Point-based Surfaces 

      Li, Xinju; Guskov, Igor (The Eurographics Association, 2005)
      We introduce a novel method for approximate alignment of point-based surfaces. Our approach is based on detecting a set of salient feature points using a scale-space representation. For each feature point we compute a ...

    • Smooth Feature Lines on Surface Meshes 

      Hildebandt, Klaus; Polthier, Konrad; Wardetzky, Max (The Eurographics Association, 2005)
      Feature lines are salient surface characteristics. Their definition involves third and fourth order surface derivatives. This often yields to unpleasantly rough and squiggly feature lines since third order derivatives are ...

    • Example-Based 3D Scan Completion 

      Pauly, Mark; Mitra, Niloy J.; Giesen, Joachim; Gross, Markus; Guibas, Leonidas J. (The Eurographics Association, 2005)
      We present a novel approach for obtaining a complete and consistent 3D model representation from incomplete surface scans, using a database of 3D shapes to provide geometric priors for regions of missing data. Our method ...

    • Extraction and Simplification of Iso-surfaces in Tandem 

      Attali, Dominique; Cohen-Steiner, David; Edelsbrunner, Herbert (The Eurographics Association, 2005)
      The tandem algorithm combines the marching cube algorithm for surface extraction and the edge contraction algorithm for surface simplification in lock-step to avoid the costly intermediate step of storing the entire extracted ...

    • Atomic Volumes for Mesh Completion 

      Podolak, Joshua; Rusinkiewicz, Szymon (The Eurographics Association, 2005)
      The increased use of scanned geometry for applications in computer graphics and 3D hardcopy output has highlighted the need for general, robust algorithms for reconstruction of watertight 3D models given partial polygonal ...

    • Robust Global Registration 

      Gelfand, Natasha; Mitra, Niloy J.; Guibas, Leonidas J.; Pottmann, Helmut (The Eurographics Association, 2005)
      We present an algorithm for the automatic alignment of two 3D shapes (data and model), without any assumptions about their initial positions. The algorithm computes for each surface point a descriptor based on local geometry ...

    • Sparse Low-degree Implicits with Applications to High Quality Rendering, Feature Extraction, and Smoothing 

      Ohtake, Yutaka; Belyaev, Alexander; Alexa, Marc (The Eurographics Association, 2005)
      We propose a new surface representation delivering an accurate approximation to a set of points scattered over a smooth surface by Sparse Low-degree IMplicits (SLIM). The SLIM surface representation consists of a sparse ...