SGP: Eurographics Symposium on Geometry Processing: Recent submissions
Now showing items 281-300 of 378
-
Robust Global Registration
(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 ... -
A Geometric Construction of Coordinates for Convex Polyhedra using Polar Duals
(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 ... -
Swept Volumes of many Poses
(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 ... -
Subdivision Schemes and Attractors
(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 ... -
Modeling with Simplicial Diffeomorphisms
(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 ... -
Sparse Low-degree Implicits with Applications to High Quality Rendering, Feature Extraction, and Smoothing
(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 ... -
Progressive Buffers: View-dependent Geometry and Texture for LOD Rendering
(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 ... -
Extraction and Simplification of Iso-surfaces in Tandem
(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 ... -
Data Structures for Simplicial Complexes: An Analysis And A Comparison
(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 ... -
Streaming Compression of Triangle Meshes
(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 ... -
Discrete Willmore Flow
(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 ... -
Setting the Boundary Free: A Composite Approach to Surface Parameterization
(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 ... -
Smooth Feature Lines on Surface Meshes
(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 ... -
Surface Reconstruction for Noisy Point Clouds
(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 ... -
Reconstruction of Solid Models from Oriented Point Sets
(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 ... -
Triangulating Point Set Surfaces with Bounded Error
(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 ... -
Non-conforming Surface Rrepresentations
(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 ... -
Atomic Volumes for Mesh Completion
(The Eurographics Association, 2005)The increased use of scanned geometry for applications in computer graphics and 3D hardcopy output has highlighted the need for general, robust algorithms for reconstruction of watertight 3D models given partial polygonal ... -
An Adaptive MLS Surface for Reconstruction with Guarantees
(The Eurographics Association, 2005)Recent work have shown that moving least squares (MLS) surfaces can be used effectively to reconstruct surfaces from possibly noisy point cloud data. Several variants of MLS surfaces have been suggested, some of which have ... -
Template-Based Mesh Completion
(The Eurographics Association, 2005)Meshes generated by range scanners and other acquisition tools are often incomplete and typically contain multiple connected components with irregular boundaries and complex holes. This paper introduces a robust algorithm ...