Browsing SGP: Eurographics Symposium on Geometry Processing by Issue Date
Now showing items 1-20 of 378
-
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
(The Eurographics Association, 2003)One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the same if they differ by a rotation. Consequently, when comparing two models, a similarity ... -
CLODs: Dual Hierarchies for Multiresolution Collision Detection
(The Eurographics Association, 2003)We present "contact levels of detail" (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a "dual hierarchy", both a multiresolution representation ... -
Multi-Chart Geometry Images
(The Eurographics Association, 2003)We introduce multi-chart geometry images, a new representation for arbitrary surfaces. It is created by resampling a surface onto a regular 2D grid. Whereas the original scheme of Gu et al. maps the entire surface onto a ... -
Explicit Surface Remeshing
(The Eurographics Association, 2003)We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the family of local modification techniques is an ... -
Efficient Max-Norm Distance Computation and Reliable Voxelization
(The Eurographics Association, 2003)We present techniques to efficiently compute the distance under max-norm between a point and a wide class of geometric primitives. We formulate the distance computation as an optimization problem and use this framework to ... -
Mesh Forging: Editing of 3D-Meshes Using Implicitly Defined Occluders
(The Eurographics Association, 2003)In recent years the ease of use and the flexibility in the editing process shifted into focus in modelling and animation applications. In this spirit we present a 3D mesh editing method that is similar to the simple ... -
Statistical Point Geometry
(The Eurographics Association, 2003)We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes of each point sample. We show how the ... -
A scalable data structure for three-dimensional non-manifold objects
(The Eurographics Association, 2003)In this paper, we address the problem of representing and manipulating non-manifold, mixed-dimensional objects described by three-dimensional simplicial complexes embedded in the 3D Euclidean space. We describe the design ... -
Edge-Sharpener: Recovering sharp features in triangulations of non-adaptively re-meshed surfaces
(The Eurographics Association, 2003)3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align the samples with the sharp edges and corners ... -
Approximate Implicitization Via Curve Fitting
(The Eurographics Association, 2003)We discuss methods for fitting implicitly defined (e.g. piecewise algebraic) curves to scattered data, which may contain problematic regions, such as edges, cusps or vertices. As the main idea, we construct a bivariate ... -
Provably Good Surface Sampling and Approximation
(The Eurographics Association, 2003)We present an algorithm for meshing surfaces that is a simple adaptation of a greedy "farthest point" technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3-dimensional Delaunay ... -
Filling Holes in Meshes
(The Eurographics Association, 2003)We describe a method for filling holes in unstructured triangular meshes. The resulting patching meshes interpolate the shape and density of the surrounding mesh. Our methods work with arbitrary holes in oriented connected ... -
Approximating and Intersecting Surfaces from Points
(The Eurographics Association, 2003)Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We present a surface approximation that is ... -
Smooth Geometry Images
(The Eurographics Association, 2003)Previous parametric representations of smooth genus-zero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a simple construction for these surfaces using ... -
Geometry Compression of Normal Meshes Using Rate-Distortion Algorithms
(The Eurographics Association, 2003)We propose a new rate-distortion based algorithm for compressing 3D surface geometry represented using triangular normal meshes. We apply the Estimation-Quantization (EQ) algorithm to compress normal mesh wavelet coefficients. ... -
3D Reconstruction Using Labeled Image Regions
(The Eurographics Association, 2003)In this paper we present a novel algorithm for reconstructing 3D scenes from a set of images. The user defines a set of polygonal regions with corresponding labels in each image using familiar 2D photo-editing tools. Our ... -
A concise b-rep data structure for stratified subanalytic objects
(The Eurographics Association, 2003)Current geometric kernels suffer from poor abstraction and design of their data structures. In part, this is due to the lack of a general mathematical framework for geometric modelling and processing. As a result, there ... -
A Geometric Database for Gene Expression Data
(The Eurographics Association, 2003)As the logical next step after sequencing the mouse genome, biologists have developed laboratory methods for rapidly determining where each of the 30K genes in the mouse genome is synthesizing protein. Applying these methods ... -
High-Pass Quantization for Mesh Encoding
(The Eurographics Association, 2003)Any quantization introduces errors. An important question is how to suppress their visual effect. In this paper we present a new quantization method for the geometry of 3D meshes, which enables aggressive quantization ... -
Global Conformal Surface Parameterization
(The Eurographics Association, 2003)We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the conformality everywhere except for a few points, ...