33 results
Search Results
Now showing 1 - 10 of 33
Item PriMo: Coupled Prisms for Intuitive Surface Modeling(The Eurographics Association, 2006) Botsch, Mario; Pauly, Mark; Gross, Markus; Kobbelt, Leif; Alla Sheffer and Konrad PolthierWe 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.Item Fast Arbitrary Splitting of Deforming Objects(The Eurographics Association, 2006) Steinemann, Denis; Otaduy, Miguel A.; Gross, Markus; Marie-Paule Cani and James O'BrienWe present a novel algorithm for efficiently splitting deformable solids along arbitrary piecewise linear crack surfaces in cutting and fracture simulations. We propose the use of a meshless discretization of the deformation field, and a novel visibility graph for fast update of shape functions in meshless discretizations. We decompose the splitting operation into a first step where we synthesize crack surfaces as triangle meshes, and a second step where we use the newly synthesized surfaces to update the visibility graph, and thus the meshless discretization of the deformation field. The separation of the splitting operation into two steps, along with our novel visibility graph, enables high flexibility and control over the splitting trajectories, provides fast dynamic update of the meshless discretization, and facilitates an easy implementation, making our algorithm scalable, versatile, and suitable for a large range of applications, from computer animation to interactive medical simulation.We present a novel algorithm for efficiently splitting deformable solids along arbitrary piecewise linear crack surfaces in cutting and fracture simulations. We propose the use of a meshless discretization of the deformation field, and a novel visibility graph for fast update of shape functions in meshless discretizations. We decompose the splitting operation into a first step where we synthesize crack surfaces as triangle meshes, and a second step where we use the newly synthesized surfaces to update the visibility graph, and thus the meshless discretization of the deformation field. The separation of the splitting operation into two steps, along with our novel visibility graph, enables high flexibility and control over the splitting trajectories, provides fast dynamic update of the meshless discretization, and facilitates an easy implementation, making our algorithm scalable, versatile, and suitable for a large range of applications, from computer animation to interactive medical simulation.Item Real-Time Ray-Casting and Advanced Shading of Discrete Isosurfaces(The Eurographics Association and Blackwell Publishing, Inc, 2005) Hadwiger, Markus; Sigg, Christian; Scharsach, Henning; Buehler, Khatja; Gross, MarkusItem Are Points the Better Graphics Primitives?(Eurographics Association, 2001) Gross, MarkusSince the early days of graphics the computer based representation of three-dimensional geometry has been one of the core research fields. Today, various sophisticated geometric modelling techniques including NURBS or implicit surfaces allow the creation of 3D graphics models with increasingly complex shape. In spite of these methods the triangle has survived over decades as the king of graphics primitives meeting the right balance between descriptive power and computational burden. As a consequence, today's consumer graphics hardware is heavily tailored for high performance triangle processing. In addition, a new generation of geometry processing methods including hierarchical representations, geometric filtering, or feature detection fosters the concept of triangle meshes for graphics modelling. Unlike triangles, points have amazingly been neglected as a graphics primitive. Although being included in APIs since many years, it is only recently that point samples experience a renaissance in computer graphics. Conceptually, points provide a mere discretization of geometry without explicit storage of topology. Thus, point samples reduce the representation to the essentials needed for rendering and enable us to generate highly optimized object representations. Although the loss of topology poses great challenges for graphics processing, the latest generation of algorithms features high performance rendering, point/pixel shading, anisotropic texture mapping, and advanced signal processing of point sampled geometry. This talk will give an overview of how recent research results in the processing of triangles and points are changing our traditional way of thinking of surface representations in computer graphics - and will discuss the question: Are Points the Better Graphics Primitives?Item Point-Based Computer Graphics(Eurographics Association, 2003) Alexa, Marc; Dachsbacher, Carsten; Gross, Markus; Pauly, Mark; van Baar, Jeroen; Zwicker, Matthias-Item Texturing Internal Surfaces from a Few Cross Sections(The Eurographics Association and Blackwell Publishing Ltd, 2007) Pietroni, Nico; Otaduy, Miguel A.; Bickel, Bernd; Ganovelli, Fabio; Gross, MarkusWe introduce a new appearance-modeling paradigm for synthesizing the internal structure of a 3D model from photographs of a few cross-sections of a real object. When the internal surfaces of the 3D model are revealed as it is cut, carved, or simply clipped, we synthesize their texture from the input photographs. Our texture synthesis algorithm is best classified as a morphing technique, which efficiently outputs the texture attributes of each surface point on demand. For determining source points and their weights in the morphing algorithm, we propose an interpolation domain based on BSP trees that naturally resembles planar splitting of real objects. In the context of the interpolation domain, we define efficient warping and morphing operations that allow for real-time synthesis of textures. Overall, our modeling paradigm, together with its realization through our texture morphing algorithm, allow users to author 3D models that reveal highly realistic internal surfaces in a variety of artistic flavors.Item Fast Simulation of Deformable Models in Contact Using Dynamic Deformation Textures(The Eurographics Association, 2006) Galoppo, Nico; Otaduy, Miguel A.; Mecklenburg, Paul; Gross, Markus; Lin, Ming C.; Marie-Paule Cani and James O'BrienWe present an efficient algorithm for simulating contacts between deformable bodies with high-resolution surface geometry using dynamic deformation textures, which reformulate the 3D elastoplastic deformation and collision handling on a 2D parametric atlas to reduce the extremely high number of degrees of freedom in such a computa- tionally demanding simulation. We perform proximity queries for deformable bodies using a two-stage algorithm directly on dynamic deformation textures, resulting in output-sensitive collision detection that is independent of the combinatorial complexity of the deforming meshes. We present a robust, parallelizable formulation for computing constraint forces using implicit methods that exploits the structure of the motion equations to achieve highly stable simulation, while taking large time steps with inhomogeneous materials. The dynamic deformation textures can also be used directly for real-time shading and can easily be implemented using SIMD architecture on commodity hardware. We show that our approach, complementing existing pioneering work, offers significant computational advantages on challenging contact scenarios in dynamic simulation of deformable bodies.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 PottmannWe 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.Item GPU-Based Ray-Casting of Quadratic Surfaces(The Eurographics Association, 2006) Sigg, Christian; Weyrich, Tim; Botsch, Mario; Gross, Markus; Mario Botsch and Baoquan Chen and Mark Pauly and Matthias ZwickerQuadratic surfaces are frequently used primitives in geometric modeling and scientific visualization, such as rendering of tensor fields, particles, and molecular structures. While high visual quality can be achieved using sophisticated ray tracing techniques, interactive applications typically use either coarsely tessellated polygonal approximations or pre-rendered depth sprites, thereby trading off visual quality and perspective correctness for higher rendering performance. In contrast, we propose an efficient rendering technique for quadric primitives based on GPU-accelerated splatting. While providing similar performance as point-sprites, our methods provides perspective correctness and superior visual quality using per-pixel ray-casting.Item A Practical Structured Light Acquisition System for Point-Based Geometry and Texture(The Eurographics Association, 2005) Sadlo, Filip; Weyrich, Tim; Peikert, Ronald; Gross, Markus; Marc Alexa and Szymon Rusinkiewicz and Mark Pauly and Matthias ZwickerWe present a simple and high-quality 3D scanning system based on structured light. It uses the common setup of a video projector, a computer-controlled turntable and a single camera. Geometry is acquired using a combination of Gray code and phase-shift projections, and it is stored and processed in a point-based representation. We achieve high accuracy by careful calibration of camera, projector, and turntable axis. In addition, we make use of the projector's calibration and extend it to a calibrated light source, allowing for a simple reconstruction of material properties for each surface point. We alternatively use a Lambertian reflectance model, or fit a Phong reflectance model to the samples under different turntable orientations. The acquisition pipeline is entirely point-based, avoiding the need of triangulation during all processing stages.