SGP06: Eurographics Symposium on Geometry Processing: Recent submissions
Now showing items 120 of 26

Nonobtuse Remeshing and Mesh Decimation
(The Eurographics Association, 2006)Quality meshing in 2D and 3D domains is an important problem in geometric modeling and scientific computing. We are concerned with triangle meshes having only nonobtuse angles. Specifically, we propose a solution for ... 
Size Functions for 3D Shape Retrieval
(The Eurographics Association, 2006)This paper sketches a technique for 3D model retrieval built on size functions, a mathematical tool to compare shapes. Size functions are introduced for the first time to discriminate among 3D objects, through the proposal ... 
Robust Principal Curvatures on Multiple Scales
(The Eurographics Association, 2006)Geometry processing algorithms often require the robust extraction of curvature information. We propose to achieve this with principal component analysis (PCA) of local neighborhoods, defined via spherical kernels centered ... 
A Quadratic Bending Model for Inextensible Surfaces
(The Eurographics Association, 2006)Relating the intrinsic Laplacian to the mean curvature normal, we arrive at a model for bending of inextensible surfaces. Due to its constant Hessian, our isometric bending model reduces cloth simulation times up to threefold. 
Overfitting Control for Surface Reconstruction
(The Eurographics Association, 2006)This paper proposes a general framework for overfitting control in surface reconstruction from noisy point data. The problem we deal with is how to create a model that will capture as much detail as possible and simultaneously ... 
Reliable Implicit Surface Polygonization using Visibility Mapping
(The Eurographics Association, 2006)We present a new algorithm to compute a topologically and geometrically accurate triangulation of an implicit surface. Our approach uses spatial subdivision techniques to decompose a manifold implicit surface into starshaped ... 
Rectangular MultiChart Geometry Images
(The Eurographics Association, 2006)Many mesh parameterization algorithms have focused on minimizing distortion and utilizing texture area, but few have addressed issues related to processing a signal on the mesh surface.We present an algorithm which partitions ... 
Designing Quadrangulations with Discrete Harmonic Forms
(The Eurographics Association, 2006)We introduce a framework for quadrangle meshing of discrete manifolds. Based on discrete differential forms, our method hinges on extending the discrete Laplacian operator (used extensively in modeling and animation) to ... 
Automatic and Interactive Mesh to TSpline Conversion
(The Eurographics Association, 2006)In Geometry Processing, and more specifically in surface approximation, one of the most important issues is the automatic generation of a quaddominant control mesh from an arbitrary shape (e.g. a scanned mesh). One of the ... 
Defining and Computing Curveskeletons with Medial Geodesic Function
(The Eurographics Association, 2006)Many applications in geometric modeling, computer graphics, visualization and computer vision benefit from a reduced representation called curveskeletons of a shape. These are curves possibly with branches which compactly ... 
A C2 Polar Jet Subdivision
(The Eurographics Association, 2006)We describe a subdivision scheme that acts on control nodes that each carry a vector of values. Each vector defines partial derivatives, referred to as jets in the following and subdivision computes new jets from old jets. ... 
Selectively Refinable Subdivision Meshes
(The Eurographics Association, 2006)We introduce RGB triangulations, an extension of redgreen triangulations that can support selective refinement over subdivision meshes generated through quadrisection of triangles. Our purpose is to define a mechanism ... 
Loop Subdivision with Curvature Control
(The Eurographics Association, 2006)In this paper the problem of curvature behavior around extraordinary points of a Loop subdivision surface is addressed. A variant of Loop s algorithm with small stencils is used that generates surfaces with bounded curvature ... 
Partial Matching of 3D Shapes with PriorityDriven Search
(The Eurographics Association, 2006)Prioritydriven search is an algorithm for retrieving similar shapes from a large database of 3D objects. Given a query object and a database of target objects, all represented by sets of local 3D shape features, the ... 
Folding Meshes: Hierarchical Mesh Segmentation based on Planar Symmetry
(The Eurographics Association, 2006)Meshes representing real world objects, both artistcreated and scanned, contain a high level of redundancy due to (possibly approximate) planar reflection symmetries, either global or localized to different subregions. ... 
A Decompositionbased Representation for 3D Simplicial Complexes
(The Eurographics Association, 2006)We define a new representation for nonmanifold 3D shapes described by threedimensional simplicial complexes, that we call the DoubleLevel Decomposition (DLD) data structure. The DLD data structure is based on a unique ... 
Probabilistic Fingerprints for Shapes
(The Eurographics Association, 2006)We propose a new probabilistic framework for the efficient estimation of similarity between 3D shapes. Our framework is based on local shape signatures and is designed to allow for quick pruning of dissimilar shapes, while ... 
Spherical Barycentric Coordinates
(The Eurographics Association, 2006)We develop spherical barycentric coordinates. Analogous to classical, planar barycentric coordinates that describe the positions of points in a plane with respect to the vertices of a given planar polygon, spherical ... 
Error Bounds and Optimal Neighborhoods for MLS Approximation
(The Eurographics Association, 2006)In recent years, the moving leastsquare (MLS) method has been extensively studied for approximation and reconstruction of surfaces. The MLS method involves local weighted leastsquares polynomial approximations, using a ... 
Poisson Surface Reconstruction
(The Eurographics Association, 2006)We show that surface reconstruction from oriented points can be cast as a spatial Poisson problem. This Poisson formulation considers all the points at once, without resorting to heuristic spatial partitioning or blending, ...