Now showing items 1-20 of 25

    • Multi-scale Geometric Modeling of Ambiguous Shapes with Toleranced Balls and Compoundly Weighted a-shapes 

      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, ...
    • Moebius Transformations For Global Intrinsic Symmetry Analysis 

      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 ...
    • Localized Delaunay Refinement for Sampling and Meshing 

      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 ...
    • Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets 

      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 ...
    • Fast and Scalable CPU/GPU Collision Detection for Rigid and Deformable Surfaces 

      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 ...
    • Polygonal Mesh Watermarking Using Laplacian Coordinates 

      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 ...
    • Designing Quad-dominant Meshes with Planar Faces 

      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. ...
    • Closed-form Blending of Local Symmetries 

      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 ...
    • Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models 

      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 ...
    • Fuzzy Geodesics and Consistent Sparse Correspondences For Deformable Shapes 

      Jian Sun; Xiaobai Chen; Thomas A. Funkhouser (2010)
      A geodesic is a parameterized curve on a Riemannian manifold governed by a second order partial differential equation. Geodesics are notoriously unstable: small perturbations of the underlying manifold may lead to dramatic ...
    • Barycentric Coordinates on Surfaces 

      Raif M. Rustamov (2010)
      This paper introduces a method for defining and efficiently computing barycentric coordinates with respect to polygons on general surfaces. Our construction is geared towards injective polygons (polygons that can be enclosed ...
    • Trivial Connections on Discrete Surfaces 

      Keenan Crane; Mathieu Desbrun; Peter Schroeder (2010)
      This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections ...
    • Moving Least Squares Coordinates 

      Josiah Manson; Scott Schaefer (2010)
      We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open polygons. Not only do these coordinates ...
    • Globally Consistent Space-Time Reconstruction 

      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 ...
    • Fast Generation of Pointerless Octree Duals 

      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 ...
    • Scales and Scale-like Structures 

      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 ...
    • On Discrete Killing Vector Fields and Patterns on Surfaces 

      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, ...
    • Enhancing Bounding Volumes using Support Plane Mappings for Collision Detection 

      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 ...
    • Mixed Finite Elements for Variational Surface Modeling 

      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 ...
    • Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes 

      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 ...