Geometry Processing Proceedings

Recent Submissions

  • Noise-Adaptive Shape Reconstruction from Raw Point Sets 

    Giraudot, Simon; Cohen-Steiner, David; Alliez, Pierre (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We propose a noise-adaptive shape reconstruction method specialized to smooth, closed shapes. Our algorithm takes as input a defect-laden point set with variable noise and outliers, and comprises three main steps. First, ...
  • Watertight Scenes from Urban LiDAR and Planar Surfaces 

    Kreveld, Marc van; Lankveld, Thijs van; Veltkamp, Remco C. (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require ...
  • Consolidation of Low-quality Point Clouds from Outdoor Scenes 

    Wang, Jun; Xu, Kai; Liu, Ligang; Cao, Junjie; Liu, Shengjun; Yu, Zeyun; Gu, Xianfeng David (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    The emergence of laser/LiDAR sensors, reliable multi-view stereo techniques and more recently consumer depth cameras have brought point clouds to the forefront as a data format useful for a number of applications. ...
  • Dirichlet Energy for Analysis and Synthesis of Soft Maps 

    Solomon, Justin; Guibas, Leonidas; Butscher, Adrian (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Soft maps taking points on one surface to probability distributions on another are attractive for representing surface mappings in the presence of symmetry, ambiguity, and combinatorial complexity. Few techniques, however, ...
  • Dynamic Maps for Exploring and Browsing Shapes 

    Kleiman, Yanir; Fish, Noa; Lanir, Joel; Cohen-Or, Daniel (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Large datasets of 3D objects require an intuitive way to browse and quickly explore shapes from the collection. We present a dynamic map of shapes where similar shapes are placed next to each other. Similarity between 3D ...
  • Animation-Aware Quadrangulation 

    Marcias, Giorgio; Pietroni, Nico; Panozzo, Daniele; Puppo, Enrico; Sorkine-Hornung, Olga (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Geometric meshes that model animated characters must be designed while taking into account the deformations that the shape will undergo during animation. We analyze an input sequence of meshes with point-to-point correspondence, ...
  • Consistent Shape Maps via Semidefinite Programming 

    Huang, Qi-Xing; Guibas, Leonidas (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Recent advances in shape matching have shown that jointly optimizing the maps among the shapes in a collection can lead to significant improvements when compared to estimating maps between pairs of shapes in isolation. ...
  • Consistent Volumetric Discretizations Inside Self-Intersecting Surfaces 

    Sacht, Leonardo; Jacobson, Alec; Panozzo, Daniele; Schüller, Christian; Sorkine-Hornung, Olga (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Decades of research have culminated in a robust geometry processing pipeline for surfaces. Most steps in this pipeline, like deformation, smoothing, subdivision and decimation, may create self-intersections. Volumetric ...
  • An Algorithm for Triangulating Multiple 3D Polygons 

    Zou, Ming; Ju, Tao; Carr, Nathan (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We present an algorithm for obtaining a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angles between adjacent triangles. ...
  • Bijective Composite Mean Value Mappings 

    Schneider, Teseo; Hormann, Kai; Floater, Michael S. (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We introduce the novel concept of composite barycentric mappings and give theoretical conditions under which they are guaranteed to be bijective. We then focus on mean value mappings and derive a simple procedure for ...
  • Locally Injective Mappings 

    Schüller, Christian; Kavan, Ladislav; Panozzo, Daniele; Sorkine-Hornung, Olga (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Mappings and deformations are ubiquitous in geometry processing, shape modeling, and animation. Numerous deformation energies have been proposed to tackle problems like mesh parameterization and volumetric deformations. ...
  • Sparse Iterative Closest Point 

    Bouaziz, Sofien; Tagliasacchi, Andrea; Pauly, Mark (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm ...
  • Fitting Polynomial Volumes to Surface Meshes with Voronoï Squared Distance Minimization 

    Paillé, Gilles-Philippe; Poulin, Pierre; Lévy, Bruno (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We propose a method for mapping polynomial volumes. Given a closed surface and an initial template volume grid, our method deforms the template grid by fitting its boundary to the input surface while minimizing a volume ...
  • Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions 

    Larsson, Thomas; Källberg, Linus (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This operation is important in, for example, classification, clustering, ...
  • Approximating Functions on a Mesh with Restricted Voronoï Diagrams 

    Nivoliers, Vincent; Lévy, Bruno (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We propose a method that computes a piecewise constant approximation of a function defined on a mesh. The approximation is associated with the cells of a restricted Voronoï diagram. Our method optimizes an objective function ...
  • Discrete Line Congruences for Shading and Lighting 

    Wang, Jun; Jiang, Caigui; Bompas, Philippe; Wallner, Johannes; Pottmann, Hellmut (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    Two-parameter families of straight lines (line congruences) are implicitly present in graphics and geometry processing in several important ways including lighting and shape analysis. In this paper we make them accessible ...
  • An Operator Approach to Tangent Vector Field Processing 

    Azencot, Omri; Ben-Chen, Mirela; Chazal, Frédéric; Ovsjanikov, Maks (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    In this paper, we introduce a novel coordinate-free method for manipulating and analyzing vector fields on discrete surfaces. Unlike the commonly used representations of a vector field as an assignment of vectors to the ...
  • Practical Anisotropic Geodesy 

    Campen, Marcel; Heistermann, Martin; Kobbelt, Leif (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    The computation of intrinsic, geodesic distances and geodesic paths on surfaces is a fundamental low-level building block in countless Computer Graphics and Geometry Processing applications. This demand led to the development ...
  • Connectivity Editing for Quad-Dominant Meshes 

    Peng, Chi-Han; Wonka, Peter (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We propose a connectivity editing framework for quad-dominant meshes. In our framework, the user can edit the mesh connectivity to control the location, type, and number of irregular vertices (with more or fewer than four ...
  • Weak Convex Decomposition by Lines-of-sight 

    Asafi, Shmuel; Goren, Avi; Cohen-Or, Daniel (The Eurographics Association and Blackwell Publishing Ltd., 2013)
    We define the convexity rank of a set of points to be the portion of mutually visible pairs of points out of the total number of pairs. Based on this definition of weak convexity, we introduce a spectral method that ...

View more