SGP03: Eurographics Symposium on Geometry Processing

Eurographics DL Repository

SGP03: Eurographics Symposium on Geometry Processing

 

Recent Submissions

  • Ziegler, Remo; Matusik, Wojciech; Pfister, Hanspeter; McMillan, Leonard (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 ...
  • Wurm, E.; Jüttler, B. (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 ...
  • Chaine, Raphaëlle (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 ...
  • Adamson, Anders; Alexa, Marc (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 ...
  • Bendels, G. H.; Klein, R. (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 ...
  • Liepa, Peter (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 ...
  • Velho, Luiz (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 ...
  • Ju, Tao; Warren, Joe; Eichele, Gregor; Thaller, Christina; Chiu, Wah; Carson, James (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 ...
  • Cazals, F.; Pouget, M. (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 ...
  • Sander, P. V.; Wood, Z. J.; Gortler, S. J.; Snyder, J.; Hoppe, H. (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 ...
  • Kazhdan, Michael; Funkhouser, Thomas; Rusinkiewicz, Szymon (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 ...
  • Losasso, F.; Hoppe, H.; Schaefer, S.; Warren, J. (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 ...
  • Gu, Xianfeng; Yau, Shing-Tung (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, ...
  • Varadhan, Gokul; Krishnan, Shankar; Kim, Young J.; Diggavi, Suhas; Manocha, Dinesh (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 ...
  • Kalaiah, Aravind; Varshney, Amitabh (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 ...
  • Kirsanov, D.; Sander, P. V.; Gortler, S. J. (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 high-resolution model. Our methods preserve the important features of ...
  • Floriani, Leila De; Hui, Annie (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 ...
  • Attene, Marco; Falcidieno, Bianca; Rossignac, Jarek; Spagnuolo, Michela (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 ...
  • Gomes, Abel J.P. (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 ...
  • Otaduy, Miguel A.; Lin, Ming C. (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 ...

View more

Search Eurographics DL


Browse

My Account

Discover

RSS Feeds