Filters

2002 - 200923
Reset filters

Settings

Author: Pauly, Mark × Has files: true × Start date: 2002 × End date: 2009 ×

Search Results

Now showing 1 - 10 of 23
  • Thumbnail Image
    Item
    PriMo: Coupled Prisms for Intuitive Surface Modeling
    (The Eurographics Association, 2006) Botsch, Mario; Pauly, Mark; Gross, Markus; Kobbelt, Leif; Alla Sheffer and Konrad Polthier
    We present a new method for 3D shape modeling that achieves intuitive and robust deformations by emulating physically plausible surface behavior inspired by thin shells and plates. The surface mesh is embedded in a layer of volumetric prisms, which are coupled through non-linear, elastic forces. To deform the mesh, prisms are rigidly transformed to satisfy user constraints while minimizing the elastic energy. The rigidity of the prisms prevents degenerations even under extreme deformations, making the method numerically stable. For the underlying geometric optimization we employ both local and global shape matching techniques. Our modeling framework allows for the specification of various geometrically intuitive parameters that provide control over the physical surface behavior. While computationally more involved than previous methods, our approach significantly improves robustness and simplifies user interaction for large, complex deformations.
  • Thumbnail Image
    Item
    Curvature-Domain Shape Processing
    (The Eurographics Association and Blackwell Publishing Ltd, 2008) Eigensatz, Michael; Sumner, Robert W.; Pauly, Mark
    We propose a framework for 3D geometry processing that provides direct access to surface curvature to facilitate advanced shape editing, filtering, and synthesis algorithms. The central idea is to map a given surface to the curvature domain by evaluating its principle curvatures, apply filtering and editing operations to the curvature distribution, and reconstruct the resulting surface using an optimization approach. Our system allows the user to prescribe arbitrary principle curvature values anywhere on the surface. The optimization solves a nonlinear least-squares problem to find the surface that best matches the desired target curvatures while preserving important properties of the original shape. We demonstrate the effectiveness of this processing metaphor with several applications, including anisotropic smoothing, feature enhancement, and multi-scale curvature editing.
  • Thumbnail Image
    Item
    Positional, Metric, and Curvature Control for Constraint-Based Surface Deformation
    (The Eurographics Association and Blackwell Publishing Ltd, 2009) Eigensatz, Michael; Pauly, Mark
    We present a geometry processing framework that allows direct manipulation or preservation of positional, metric, and curvature constraints anywhere on the surface of a geometric model. Target values for these properties can be specified point-wise or as integrated quantities over curves and surface patches embedded in the shape. For example, the user can draw several curves on the surface and specify desired target lengths, manipulate the normal curvature along these curves, or modify the area or principal curvature distribution of arbitrary surface patches. This user input is converted into a set of non-linear constraints. A global optimization finds the new deformed surface that best satisfies the constraints, while minimizing adaptable measures for metric and curvature distortion that provide explicit control of the deformation semantics. We illustrate how this approach enables flexible surface processing and shape editing operations not available in current systems.
  • Thumbnail Image
    Item
    Geometric Modeling Based on Triangle Meshes
    (The Eurographics Association, 2006) Botsch, Mario; Pauly, Mark; Rössl, Christian; Bischoff, Stephan; Kobbelt, Leif; Nadia Magnenat-Thalmann and Katja Bühler
    In the last years triangle meshes have become increasingly popular and are nowadays intensively used in many different areas of computer graphics and geometry processing. In classical CAGD irregular triangle meshes developed into a valuable alternative to traditional spline surfaces, since their conceptual simplicity allows for more flexible and highly efficient processing. Moreover, the consequent use of triangle meshes as surface representation avoids error-prone conversions, e.g., from CAD surfaces to meshbased input data of numerical simulations. Besides classical geometric modeling, other major areas frequently employing triangle meshes are computer games and movie production. In this context geometric models are often acquired by 3D scanning techniques and have to undergo postprocessing and shape optimization techniques before being actually used in production.This course discusses the whole geometry processing pipeline based on triangle meshes. We will first introduce general concepts of surface representations and point out the advantageous properties of triangle meshes in Section 2, and present efficient data structures for their implementation in Section 3. The different sources of input data and types of geometric and topological degeneracies and inconsistencies are described in Section 4, as well as techniques for their removal, resulting in clean two-manifold meshes suitable for further processing. Mesh quality criteria measuring geometric smoothness and element shape together with the corresponding analysis techniques are presented in Section 6. Mesh smoothing reduces noise in scanned surfaces by generalizing signal processing techniques to irregular triangle meshes (Section 7). Similarly, the underlying concepts from differential geometry are useful for surface parametrization as well (Section 8). Due to the enormous complexity of meshes acquired by 3D scanning, mesh decimation techniques are required for error-controlled simplification (Section 9). The shape of triangles, which is important for the robustness of numerical simulations, can be optimized by general remeshing methods (Section 10). After optimizing meshes with respect to the different quality criteria, we finally present techniques for intuitive and interactive shape deformation (Section 11). Since solving linear systems is a commonly required component for many of the presented mesh processing algorithms, we will discuss their efficient solution and compare several existing libraries in Section 12.
  • Thumbnail Image
    Item
    Point-Based Computer Graphics
    (Eurographics Association, 2003) Alexa, Marc; Dachsbacher, Carsten; Gross, Markus; Pauly, Mark; van Baar, Jeroen; Zwicker, Matthias
    -
  • Thumbnail Image
    Item
    Example-Based 3D Scan Completion
    (The Eurographics Association, 2005) Pauly, Mark; Mitra, Niloy J.; Giesen, Joachim; Gross, Markus; Guibas, Leonidas J.; Mathieu Desbrun and Helmut Pottmann
    We present a novel approach for obtaining a complete and consistent 3D model representation from incomplete surface scans, using a database of 3D shapes to provide geometric priors for regions of missing data. Our method retrieves suitable context models from the database, warps the retrieved models to conform with the input data, and consistently blends the warped models to obtain the final consolidated 3D shape. We define a shape matching penalty function and corresponding optimization scheme for computing the non-rigid alignment of the context models with the input data. This allows a quantitative evaluation and comparison of the quality of the shape extrapolation provided by each model. Our algorithms are explicitly designed to accommodate uncertain data and can thus be applied directly to raw scanner output. We show on a variety of real data sets how consistent models can be obtained from highly incomplete input. The information gained during the shape completion process can be utilized for future scans, thus continuously simplifying the creation of complex 3D models.
  • Thumbnail Image
    Item
    Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces
    (The Eurographics Association, 2004) Andersson, Mattias; Giesen, Joachim; Pauly, Mark; Speckmann, Bettina; Markus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz
    Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. In contrast to the trivial lower bound, the upper bound indicates that a sampling condition that is used in many computational geometry proofs is quite reasonable from a practical point of view.
  • Thumbnail Image
    Item
    Probabilistic Fingerprints for Shapes
    (The Eurographics Association, 2006) Mitra, Niloy J.; Guibas, Leonidas; Giesen, Joachim; Pauly, Mark; Alla Sheffer and Konrad Polthier
    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 guaranteeing not to miss any shape with significant similarities to the query model in shape database retrieval applications. Since directly evaluating 3D similarity for large collections of signatures on shapes is expensive and impractical, we propose a suitable but compact approximation based on probabilistic fingerprints which are computed from the shape signatures using Rabin s hashing scheme and a small set of random permutations. We provide a probabilistic analysis that shows that while the preprocessing time depends on the complexity of the model, the fingerprint size and hence the query time depends only on the desired confidence in our estimated similarity. Our method is robust to noise, invariant to rigid transforms, handles articulated deformations, and effectively detects partial matches. In addition, it provides important hints about correspondences across shapes which can then significantly benefit other algorithms that explicitly align the models. We demonstrate the utility of our method on a wide variety of geometry processing applications.
  • Thumbnail Image
    Item
    Uncertainty and Variability in Point Cloud Surface Data
    (The Eurographics Association, 2004) Pauly, Mark; Mitra, Niloy J.; Guibas, Leonidas J.; Markus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz
    We present a framework for analyzing shape uncertainty and variability in point-sampled geometry. Our representation is mainly targeted towards discrete surface data stemming from 3D acquisition devices, where a finite number of possibly noisy samples provides only incomplete information about the underlying surface. We capture this uncertainty by introducing a statistical representation that quantifies for each point in space the likelihood that a surface fitting the data passes through that point. This likelihood map is constructed by aggregating local linear extrapolators computed from weighted least squares fits. The quality of fit of these extrapolators is combined into a corresponding confidence map that measures the quality of local tangent estimates. We present an analysis of the effect of noise on these maps, show how to efficiently compute them, and extend the basic definition to a scale-space formulation. Various applications of our framework are discussed, including an adaptive re-sampling method, an algorithm for reconstructing surfaces in the presence of noise, and a technique for robustly merging a set of scans into a single point-based representation.
  • Thumbnail Image
    Item
    Versatile Virtual Materials Using Implicit Connectivity
    (The Eurographics Association, 2006) Wicke, Martin; Hatt, Philipp; Pauly, Mark; Müller, Matthias; Gross, Markus; Mario Botsch and Baoquan Chen and Mark Pauly and Matthias Zwicker
    We propose a new method for strain computation in mesh-free simulations. Without storing connectivity information, we compute strain using local rest states that are implicitly defined by the current system configuration. Particles in the simulation are subject to restoring forces arranging them in a locally defined lattice. The orientation of the lattice is found using local shape matching techniques. The strain state of each particle can then be computed by comparing the actual positions of the neighboring particles to their assigned lattice positions. All necessary information needed to compute strains is contained in the current state of the simulation, no rest state or connectivity information is stored. Since no time integration is used to compute the strain state, errors cannot accumulate, and the method is well-suited for stiff materials. In order to simulate phase transitions, the strain computation can be integrated into an existing particle-based fluid simulation framework. Implementing phase transitions between liquid and solid states becomes simple and elegant, since no transfer of material between different representations is needed. Using the current neighborhood relationships, the model provides penalty-based inter-object and self-collision handling at no additional computational cost.