SGP05: Eurographics Symposium on Geometry Processing

Eurographics DL Repository

SGP05: Eurographics Symposium on Geometry Processing

 

Recent Submissions

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Schaefer, Scott; Levin, David; Goldman, Ron (The Eurographics Association, 2005)
    Subdivision schemes generate self-similar curves and surfaces. Therefore there is a close connection between curves and surfaces generated by subdivision algorithms and self-similar fractals generated by Iterated Function ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Floriani, Leila De; Hui, Annie (The Eurographics Association, 2005)
    In this paper, we review, analyze and compare representations for simplicial complexes. We classify such representations, based on the dimension of the complexes they can encode, into dimension-independent structures, and ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Alexa, Marc (The Eurographics Association, 2005)
    Surface geometry is commonly represented by a collection of primitives. Conforming representations consist of primitives meeting at their boundaries (e.g., in a triangle mesh two triangles are incident upon an edge). Without ...
  • 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 ...
  • 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 ...

View more

Search Eurographics DL


Browse

My Account

Discover

RSS Feeds