SGP03: Eurographics Symposium on Geometry Processing: Recent submissions
Now showing items 120 of 25

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 photoediting tools. Our ... 
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 ... 
A Geometric Convection Approach of 3D Reconstruction
(The Eurographics Association, 2003)This paper introduces a fast and efficient algorithm for surface reconstruction. As many algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite, sufficiently dense, subset of its ... 
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 ... 
Mesh Forging: Editing of 3DMeshes 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 ... 
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 ... 
Estimating Differential Quantities Using Polynomial Fitting of Osculating Jets
(The Eurographics Association, 2003)This paper addresses the pointwise estimation of differential properties of a smooth manifold S a curve in the plane or a surface in 3D assuming a point cloud sampled over S is provided. The method consists of fitting ... 
Stellar Subdivision Grammars
(The Eurographics Association, 2003)In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which production rules represent topological and ... 
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 ... 
MultiChart Geometry Images
(The Eurographics Association, 2003)We introduce multichart 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 ... 
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 ... 
Smooth Geometry Images
(The Eurographics Association, 2003)Previous parametric representations of smooth genuszero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a simple construction for these surfaces using ... 
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, ... 
Efficient MaxNorm Distance Computation and Reliable Voxelization
(The Eurographics Association, 2003)We present techniques to efficiently compute the distance under maxnorm between a point and a wide class of geometric primitives. We formulate the distance computation as an optimization problem and use this framework to ... 
Simple Silhouettes for Complex Surfaces
(The Eurographics Association, 2003)Complex meshes tend to have intricate, detailed silhouettes. This paper proposes two algorithms for extracting a simpler, approximate silhouette from a highresolution model. Our methods preserve the important features of ... 
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 threedimensional nonmanifold objects
(The Eurographics Association, 2003)In this paper, we address the problem of representing and manipulating nonmanifold, mixeddimensional objects described by threedimensional simplicial complexes embedded in the 3D Euclidean space. We describe the design ... 
EdgeSharpener: Recovering sharp features in triangulations of nonadaptively remeshed surfaces
(The Eurographics Association, 2003)3D scanners, isosurface 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 ... 
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 ... 
A concise brep 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 ...