SGP: Eurographics Symposium on Geometry Processing: Recent submissions
Now showing items 181-200 of 378
-
Fast Generation of Pointerless Octree Duals
(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 ... -
High Fidelity Scan Merging
(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 ... -
Scales and Scale-like Structures
(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 ... -
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
(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 ... -
Feature Preserving Mesh Generation from 3D Point Clouds
(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 ... -
Globally Consistent Space-Time Reconstruction
(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 and Scalable CPU/GPU Collision Detection for Rigid and Deformable Surfaces
(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 ... -
Enhancing Bounding Volumes using Support Plane Mappings for Collision Detection
(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 ... -
Iso-geometric Finite Element Analysis Based on Catmull-Clark Subdivision Solids
(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 ... -
Polygonal Mesh Watermarking Using Laplacian Coordinates
(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 ... -
Mixed Finite Elements for Variational Surface Modeling
(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 ... -
One Point Isometric Matching with the Heat Kernel
(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, ... -
Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models
(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 ... -
Trivial Connections on Discrete Surfaces
(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 ... -
Fuzzy Geodesics and Consistent Sparse Correspondences For Deformable Shapes
(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 ... -
Moving Least Squares Coordinates
(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 ... -
Barycentric Coordinates on Surfaces
(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 ... -
Guest Editorial
(The Eurographics Association and Blackwell Publishing Ltd, 2010) -
Separatrix Persistence: Extraction of Salient Edges on Surfaces Using Topological Methods
(The Eurographics Association and Blackwell Publishing Ltd, 2009)Salient edges are perceptually prominent features of a surface. Most previous extraction schemes utilize the notion of ridges and valleys for their detection, thereby requiring curvature derivatives which are rather sensitive ... -
Estimating the Laplace-Beltrami Operator by Restricting 3D Functions
(The Eurographics Association and Blackwell Publishing Ltd, 2009)We present a novel approach for computing and solving the Poisson equation over the surface of a mesh. As in previous approaches, we define the Laplace-Beltrami operator by considering the derivatives of functions defined ...