29-Issue 5

Eurographics DL Repository

29-Issue 5

 

Geometry Processing Proceedings

Recent Submissions

  • Patrick Mullen; Fernando de Goes; Mathieu Desbrun; David Cohen-Steiner; Pierre Alliez (2010)
    We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous methods through an unsigned distance ...
  • Frederic Cazals; Tom Dreyfus (2010)
    Dealing with ambiguous data is a challenge in Science in general and geometry processing in particular. One route of choice to extract information from such data consists of replacing the ambiguous input by a continuum, ...
  • Tamal K. Dey; Joshua A. Levine; Andrew Slatton (2010)
    The technique of Delaunay renement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not ...
  • Vladimir G. Kim; Yaron Lipman; Xiaobai Chen; Thomas Funkhouser (2010)
    The goal of our work is to develop an algorithm for automatic and robust detection of global intrinsic symmetries in 3D surface meshes. Our approach is based on two core observations. First, symmetry invariant point sets ...
  • Mirela Ben-Chen; Adrian Butscher; Justin Solomon; Leonidas Guibas (2010)
    Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value on the other. Symmetry comes in many flavors, ...
  • Deboshmita Ghosh; Nina Amenta; Michael Kazhdan (2010)
    We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of point-pairs which should be symmetric, we ...
  • Thomas Lewiner; Vinicius Mello; Adelailson Peixoto; Sinesio Pesco; Helio Lopes (2010)
    Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee direct continuous interpolation of this data ...
  • Mirko Zadravec; Alexander Schiftner; Johannes Wallner (2010)
    We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aesthetically pleasing and has evenly spaced vertices. ...
  • Eric Landreneau; Scott Schaefer (2010)
    We present a method for generating scales and scale-like structures on a polygonal mesh through surface replacement. As input, we require a triangular mesh that will be covered with scales and one or more proxy-models to ...
  • Julie Digne; Jean-Michel Morel; Nicolas Audfray; Claire Lartigue (2010)
    For each scanned object 3D triangulation laser scanners deliver multiple sweeps corresponding to multiple laser motions and orientations. The problem of aligning these scans has been well solved by using rigid and, more ...
  • Nader Salman; Mariette Yvinec; Quentin Merigot (2010)
    We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the covariance matrices of Voronoi cells, we first ...
  • Tiberiu Popa; Ian South-Dickinson; Derek Bradley; Alla Sheffer; Wolfgang Heidrich (2010)
    Most objects deform gradually over time, without abrupt changes in geometry or topology, such as changes in genus. Correct space-time reconstruction of such objects should satisfy this gradual change prior. This requirement ...
  • Marcel Campen; Leif Kobbelt (2010)
    Abstract We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and ...
  • Simon Pabst; Artur Koch; Wolfgang Strasser (2010)
    We present a new hybrid CPU/GPU collision detection technique for rigid and deformable objects based on spatial subdivision. Our approach efficiently exploits the massive computational capabilities of modern CPUs and GPUs ...
  • Athanasios Vogiannou; Konstantinos Moustakas; Dimitrios Tzovaras; Michael G. Strintzis (2010)
    In this paper we present a new method for improving the performance of the widely used Bounding Volume Hierarchies for collision detection. The major contribution of our work is a culling algorithm that serves as a ...
  • Ying Yang; Ioannis Ivrissimtzis (2010)
    We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x, y, z) of the mesh vertices, then construct ...
  • Daniel Burkhart; Bernd Hamann; Georg Umlauf (2010)
    We present a volumetric iso-geometric finite element analysis based on Catmull-Clark solids. This concept allows one to use the same representation for the modeling, the physical simulation, and the visualization, which ...
  • Alec Jacobson; Elif Tosun; Olga Sorkine; Denis Zorin (2010)
    Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints. For example, high-qualityC2 surfaces that ...
  • Maks Ovsjanikov; Quentin Merigot; Facundo Memoli; Leonidas Guibas (2010)
    A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particularly useful case of such maps is isometries, ...
  • Tamal K. Dey; Kuiyu Li; Chuanjiang Luo; Pawas Ranjan; Issam Safa; Yusu Wang (2010)
    Although understanding of shape features in the context of shape matching and retrieval has made considerable progress in recent years, the case for partial and incomplete models in presence of pose variations still begs ...

View more