Browsing SGP04: Eurographics Symposium on Geometry Processing by Issue Date
Now showing items 1-20 of 25
-
Signal-Specialized Parameterization for Piecewise Linear Reconstruction
(The Eurographics Association, 2004)We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of signal error, our metric predicts the signal ... -
Isotopic Approximation of Implicit Curves and Surfaces
(The Eurographics Association, 2004)Implicit surfaces are defined as the zero set of a function F : R<sup>3</sup>-> R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined ... -
Symmetry Descriptors and 3D Shape Matching
(The Eurographics Association, 2004)In this paper, we present the Symmetry Descriptors of a 3D model. This is a collection of spherical functions that describes the measure of a model's rotational and reflective symmetry with respect to every axis passing ... -
Shape Segmentation Using Local Slippage Analysis
(The Eurographics Association, 2004)We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or more slippable motions: rigid motions which, ... -
Differentiable Parameterization of Catmull-Clark Subdivision Surfaces
(The Eurographics Association, 2004)Subdivision-based representations are recognized as important tools for the generation of high-quality surfaces for Computer Graphics. In this paper we describe two parameterizations of Catmull-Clark subdivision surfaces ... -
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
(The Eurographics Association, 2004)Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two novel approaches for maintaining mesh clusterings ... -
Second Order Smoothness over Extraordinary Vertices
(The Eurographics Association, 2004)Catmull & Clark subdivision is now a standard for smooth free-form surface modeling. These surfaces are everywhere curvature continuous except at points corresponding to vertices not incident on four edges. While the surface ... -
Geometric Texture Synthesis by Example
(The Eurographics Association, 2004)Patterns on real-world objects are often due to variations in geometry across the surface. Height fields and other common parametric methods cannot synthesize many forms of geometric surface texture such as thorns, scales, ... -
Topology Preserving Surface Extraction Using Adaptive Subdivision
(The Eurographics Association, 2004)We address the problem of computing a topology preserving isosurface from a volumetric grid using Marching Cubes for geometry processing applications. We present a novel topology preserving subdivision algorithm to generate ... -
Persistence Barcodes for Shapes
(The Eurographics Association, 2004)In this paper, we initiate a study of shape description and classification via the application of persistent homology to two tangential constructions on geometric objects. Our techniques combine the differentiating power ... -
Comparing Point Clouds
(The Eurographics Association, 2004)Point clouds are one of the most primitive and fundamental surface representations. A popular source of point clouds are three dimensional shape acquisition devices such as laser range scanners. Another important field ... -
Simplification and Improvement of Tetrahedral Models for Simulation
(The Eurographics Association, 2004)Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a tetrahedral model for efficient simulation. We have developed an algorithm that both reduces the number of tetrahedra in ... -
Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis
(The Eurographics Association, 2004)We describe a fully automatic method, called iso-charts, to create texture atlases on arbitrary meshes. It is the first to consider stretch not only when parameterizing charts, but also when forming charts. The output atlas ... -
Laplacian Surface Editing
(The Eurographics Association, 2004)Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surface and that, consequently, surface editing ... -
Seamless Texture Atlases
(The Eurographics Association, 2004)Texture atlas parameterization provides an effective way to map a variety of color and data attributes from 2D texture domains onto polygonal surface meshes. However, the individual charts of such atlases are typically ... -
A Remeshing Approach to Multiresolution Modeling
(The Eurographics Association, 2004)Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive and plausible manner. A given shape is ... -
Lofting Curve Networks using Subdivision Surfaces
(The Eurographics Association, 2004)Lofting is a traditional technique for creating a curved shape by first specifying a network of curves that approximates the desired shape and then interpolating these curves with a smooth surface. This paper addresses the ... -
Parameterization of Triangle Meshes over Quadrilateral Domains
(The Eurographics Association, 2004)We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques is used to generate a partition of the model ... -
Registration of Point Cloud Data from a Geometric Optimization Perspective
(The Eurographics Association, 2004)We propose a framework for pairwise registration of shapes represented by point cloud data (PCD). We assume that the points are sampled from a surface and formulate the problem of aligning two PCDs as a minimization of the ... -
A data structure for non-manifold simplicial d-complexes
(The Eurographics Association, 2004)We propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of ...