Fast Interactive Region of Interest Selection for Volume Visualization (2009)
Abstract. We describe a new method to support the segmentation of a volumetric MRI- or CT-dataset such that only the components selected by the user are displayed by a volume renderer for visual...
(Guest Editors) Automatic Generation of Structure Preserving Multiresolution Models (2009)
We are proposing a multiresolution representation which uses a subdivision surface as a smooth base surface with respect to which a high resolution mesh is defined by normal displacement. While this...
M. Alexa, S. Rusinkiewicz, Phong Splatting, Mario Botsch, Michael Spernat, Leif Kobbelt
Surface splatting has developed into a valuable alternative to triangle meshes when it comes to rendering of highly detailed massive datasets. However, even highly accurate splat approximations of...
Interactive mesh editing has become an essential com- (2008)
Martin Marinov, Mario Botsch, Leif Kobbelt
Multiresolution shape editing performs global deformations while preserving fine surface details by modifying a smooth base surface and reconstructing the modified detailed surface as a normal...
Computer Graphics Group (2008)
Mario Botsch, David Bommes, Christoph Vogel, Leif Kobbelt
In an increasing number of applications triangle meshes represent a flexible and efficient alternative to traditional NURBS-based surface representations. Especially in engineering applications it is...
(Guest Editors) Abstract Structure Preserving CAD Model Repair (2008)
Eurographics M. Alexa, J. Marks, Stephan Bischoff, Leif Kobbelt
There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface oriented algorithms...
Ip Sar Dessai, Er Hornung, Leif Kobbelt
Methods for optical motion capture often require timeconsuming manual processing before the data can be used for subsequent tasks such as retargeting or character animation. These processing steps...
Informatik Und, Dr. Pierre Alliez, Prof Dr, Leif Kobbelt, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar.
PriMo: Coupled Prisms for Intuitive Surface Modeling Abstract (2008)
Konrad Polthier, Alla Sheffer (editors, Mario Botsch, Mark Pauly, Markus Gross, Leif Kobbelt
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...
Efficient surface reconstruction and reverse engineering techniques are usually based on a polygonal mesh representation of the geometry: the resulting models emerge from piecewise linear...
M. Pauly, M. Zwicker, High-quality Surface, Splatting Today’s Gpus, Mario Botsch, Er Hornung, ...
Because of their conceptual simplicity and superior flexibility, point-based geometries evolved into a valuable alternative to surface representations based on polygonal meshes. Elliptical surface...
Organizers Denis Zorin, Peter Schröder Caltech, Denis Zorin, Tony Derose, Adi Levin, Peter Schröder, ...
Morning Session: Introductory Material The morning section will focus on the foundations of subdivision, starting with subdivision curves and moving on to surfaces. We will review and compare a...
Received (Day Month Year) Revised (Day Month Year) Accepted (Day Month Year) (2008)
Junho Kim, Seungyong Lee, Leif Kobbelt, Communicated (xxxxxxxxxx
This paper presents a novel framework for view-dependent streaming of multiresolution meshes. In contrast to conventional progressive streaming in which the resolution of a model changes globally,...
Abstract Structure Recovery via Hybrid Variational Surface (2008)
Eurographics M. Alexa, J. Marks, Jianhua Wu, Leif Kobbelt
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to represent the geometric...
On-the-fly curve-skeleton computation for 3d shapes (2008)
Andrei Sharf, Thomas Lewiner, Ariel Shamir, Leif Kobbelt, Autores Andrei Sharf, Thomas Lewiner, ...
Palavras Chave: 1. 3D curve-skeleton 2. deformable models 3. skinning Número de páginas: 7 Data de submissão: February 10 th, 2007
Visual Comput (2006) DOI 10.1007/s00371-006-0050-2 ORIGINAL ARTICLE (2008)
Darko Pavić, Volker Schönefeld, Leif Kobbelt, D. Pavić, V. Schönefeld, L. Kobbelt
Fragment-based image completion techniques are a very powerful tool to fill in missing pixel information, e.g., when removing a foreground object from a digital photo. The conceptual idea is to fill...
Stephan Michael Bischoff, Aus Pforzheim, Berichter Prof, ...
zur Erlangung des akademischen Grades eines
(Guest Editors) Abstract Multiresolution Surface Representation Based on Displacement Volumes (2008)
Eurographics P. Brunet, D. Fellner, Mario Botsch, Leif Kobbelt
We propose a new representation for multiresolution models which uses volume elements enclosed between the different resolution levels to encode the detail information. Keeping these displacement...
Prof Dr, Thorsten Herfet, Mitglieder Des Prüfungsausschusses, Prof Dr, ...
Die sichtbare Welt meinte Platon, sei nur die Projektion einer tieferen rein mathematischen Wirklichkeit: Abstrakte Linien, die sich zu Dreiecken verbinden, die zu den Seitenflächen von Körpern...
Senior Researcher, Advisor Prof, Leif Kobbelt, Rwth Aachen, Co-advisor Prof, Peter Schröder
04/1999 M.Sc. in Mathematics (Dipl. Math., summa cum laude) University of Erlangen-Nürnberg, Germany. 10/1994 – 04/1999 Studies of Mathematics and Computer Science University of...
A Remeshing Approach to Multiresolution Modeling Abstract (2008)
R. Scopigno, D. Zorin, Mario Botsch, Leif Kobbelt
Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive and plausible...
On-the-fly Curve-skeleton Computation for 3D Shapes (2008)
Andrei Sharf, Thomas Lewiner, Ariel Shamir, Leif Kobbelt
The curve-skeleton of a 3D object is an abstract geometrical and topological representation of its 3D shape. It maps the spatial relation of geometrically meaningful parts to a graph structure. Each...
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky et al. [1]. While the...
Abstract Feature Sensitive Sampling for Interactive Remeshing (2008)
Mario Botsch, Christian Rössl, Leif Kobbelt
We present a technique for remeshing irregular triangles meshes where the distribution and alignment can be adapted to the underlying geometry. Following the interactive virtual range scanner...
Stephan Bischoff, Darko Pavic, Leif Kobbelt
We present a fully automatic technique which converts an inconsistent input mesh into an output mesh that is guaranteed to be a clean and consistent mesh representing the closed manifold surface of a...
M. Pauly, M. Zwicker, High-quality Surface, Splatting Today’s Gpus, Mario Botsch, Er Hornung, ...
Because of their conceptual simplicity and superior flexibility, point-based geometries evolved into a valuable alternative to surface representations based on polygonal meshes. Elliptical surface...
Leif Kobbelt, J. Peters, L. Kobbelt, Patch Face Facecenter
Abstract. We present a gallery of simple curvature continuous surfaces that possess the topological structure of the Platonic solids. These spherelike surfaces consist of one cubic triangular or...
Hierarchical solutions for the deformable surface problem in visualization (2008)
Christoph Lürig, Leif Kobbelt, Thomas Ertl
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it in the context of...
GPU-Based Multiresolution Deformation Using Approximate (2008)
Normal Field Reconstruction, Martin Marinov, Mario Botsch, Leif Kobbelt
this paper we present algorithms for computing both the deformation and the detail reconstruction emerging in a typical two-scale mesh modeling framework on the GPU. To make this possible, we show...
GPU-based Tolerance Volumes for Mesh Processing (2008)
Mario Botsch, David Bommes, Christoph Vogel, Leif Kobbelt
In an increasing number of applications triangle meshes represent a flexible and efficient alternative to traditional NURBS-based surface representations. Especially in engineering applications it is...
Hierarchical solutions for the deformable surface problem in visualization (2007)
Christoph Lurig, Leif Kobbelt, Thomas Ertl
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it in the context of...
Extraction of Feature Lines on Triangulated Surfaces Using Morphological Operators (2007)
Christian Rössl, Christian R Ossl, Leif Kobbelt, Hans-peter Seidel, Im Stadtwald
Triangle meshes are a popular representation of surfaces in computer graphics. Our aim is to detect feature on such surfaces. Feature regions distinguish themselves by high curvature. We are using...
Constructing Variationally Optimal Curves using Subdivision (2007)
Subdivision is a powerful paradigm for the generation of curves and surfaces. It is easy to implement, computationally efficient, and useful in a variety of applications because of its intimate...
Geometric Fairing of Irregular Meshes using Mesh Hierarchies (2007)
Robert Schneider, Leif Kobbelt, H. P. Seidel
In a recent paper we presented a new fairing algorithm for irregular meshes that form a manifold, based on solving a non-linear fourth order partial differential equation (PDE) that only
University of Erlangen–Nürnberg Abstract (2007)
Subdivision is a powerful paradigm for the generation of curves and surfaces. It is easy to implement, computationally efficient, and useful in a variety of applications because of its intimate...
Abstract Fast Mesh Decimation by Multiple-Choice Techniques (2007)
We present a new mesh decimation framework which is based on the probabilistic optimization technique of Multiple-Choice algorithms. While producing the same expected quality of the output meshes,...
Multiresolution Modeling of Point-Sampled Geometry (2007)
Mark Pauly, Leif Kobbelt, Markus Gross
Abstract. We present a framework and algorithms for multiresolution modeling of point-sampled geometry. Most of our techniques extend the key ingredients of recent multiresolution editing concepts,...
Abstract Interactive Multi-Resolution Modeling on Arbitrary Meshes (2007)
Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-peter Seidel
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful...
Abstract Geometric Fairing of Irregular Meshes for Free-Form Surface (2007)
Robert Schneider, Leif Kobbelt
In this paper we present a new algorithm for smoothing arbitrary triangle meshes while satisfying G 1 boundary conditions. The algorithm is based on solving a non-linear fourth order partial...
Efficient surface reconstruction and reverse engineering techniques are usually based on a polygonal mesh representation of the geometry: the resulting models emerge from piecewise linear...
Abstract Multiresolution Hierarchies on Unstructured Triangle Meshes (2007)
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle meshes are...
Improved Bi-Laplacian Mesh Fairing (2007)
Robert Schneider, Leif Kobbelt, Hans-peter Seidel
Abstract. Algorithms to create fair meshes can be divided into two categories, depending on whether they are linear or nonlinear. Linear methods have the advantage of being fast, robust and easy to...
Computer Graphics Group (2007)
Swen Campagna, Leif Kobbelt, Hans-peter Seidel
Due to their simplicity triangle meshes are used to represent surfaces in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large...
EUROGRAPHICS 2003 / P. Brunet and D. Fellner (2007)
Guest Editors Volume, Eurographics P. Brunet, D. Fellner, Mario Botsch, Leif Kobbelt
We propose a new representation for multiresolution models which uses volume elements enclosed between the different resolution levels to encode the detail information. Keeping these displacement...
Abstract Subdivision Scheme Tuning Around Extraordinary Vertices (2007)
In this paper we extend the standard method to derive and optimize subdivision rules in the vicinity of extraordinary vertices (EV). Starting from a given set of rules for regular control meshes, we...
A Remeshing Approach to Multiresolution Modeling Abstract (2007)
R. Scopigno, D. Zorin, Mario Botsch, Leif Kobbelt
Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive and plausible...
Iterative mesh generation for FE-computations on free form surfaces (2007)
Kobbelt, Leif, Hesse, Torsten, Prautzsch, Hartmut, Schweizerhof, Karl
Geometric Modeling Based on Polygonal Meshes (2007)
Botsch, Mario, Pauly, Mark, Kobbelt, Leif, Alliez, Pierre, Lévy, Bruno, Bischoff, Stephan, ...
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...
Competing fronts for coarse–to–fine surface reconstruction (2006)
Andrei Sharf, Thomas Lewiner, Ariel Shamir, Leif Kobbelt, Daniel Cohen–or
Abstract. We present a deformable model to reconstruct a surface from a point cloud. The model is based on an explicit mesh representation composed of multiple competing evolving fronts. These fronts...
Alexander Hornung, Er Hornung, Leif Kobbelt
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph structure embedded into...
Iterative Multi-View Plane Fitting (2006)
We present a method for the reconstruction of 3D planes from calibrated 2D images. Given a set of pixels# in a reference image, our method computes a plane which best approximates that part of the...
Robust and Efficient Photo-Consistency Estimation for Volumetric 3D Reconstruction (2006)
Alexander Hornung, Er Hornung, Leif Kobbelt
Estimating photo-consistency is one of the most important ingredients for any 3D stereo reconstruction technique that is based on a volumetric scene representation. This paper presents a new,...
A Robust Two-Step Procedure for Quad-Dominant Remeshing (2006)
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the first step, we apply a...
Extracting Consistent and Manifold Interfaces (2006)
Stephan Bischoff, Leif Kobbelt
We propose an algorithm to construct a set of interfaces that separate the connected components of a multi-valued volume dataset.
Geometric Modeling Based on Triangle Meshes (2006)
Botsch, Mario, Pauly, Mark, Rössl, Christian, Bischoff, Stephan, Kobbelt, Leif
In the last years triangle meshes have become increasingly popular and are nowad ays intensively used in many different areas of computer graphics and geometry p rocessing. In classical CAGD...
Physically Based Tracking of Cloth (2006)
Hasler, Nils, Asbach, Mark, Rosenhahn, Bodo, Ohm, Jens-Rainer, Seidel, Hans-Peter, Kobbelt, Leif, ...
In this work a method for tracking fabrics in videos is proposed which, unlike most other cloth tracking algorithms, employs an analysis-by-synthesis approach. That is tracking consists of optimising...
Geometric Modeling Based on Triangle Meshes (2006)
Botsch, Mario, Pauly, Mark, Rössl, Christian, Bischoff, Stephan, Kobbelt, Leif
In the last years triangle meshes have become increasingly popular and are nowad ays intensively used in many different areas of computer graphics and geometry p rocessing. In classical CAGD...
On-the-fly Point Clouds through Histogram Pyramids (2006)
Ziegler, Gernot, Theobalt, Christian, Seidel, Hans-Peter, Kobbelt, Leif, Kuhlen, Torsten, Aach, Til, ...
Image Pyramids, as created during a reduction process of 2D image maps, are frequently used in porting non-local algorithms to graphics hardware. A Histogram pyramid (short: HistoPyramid), a special...
Snakes on triangle meshes (2005)
Stephan Bischoff, Tobias Wey, Leif Kobbelt
Abstract. In this work we introduce a new method for representing and evolving snakes that are constrained to lie on a prescribed surface (triangle mesh). The new representation allows to...
Real-time shape editing using radial basis functions (2005)
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampling quality in order...
Efficient linear system solvers for mesh processing (2005)
Mario Botsch, David Bommes, Leif Kobbelt
Abstract. The use of polygonal mesh representations for freeform geometry enables the formulation of many important geometry processing tasks as the solution of one or several linear systems. As a...
Efficient spectral watermarking of large meshes with orthogonal basis functions (2005)
Abstract Allowing for copyright protection and ownership assertion, digital watermarking techniques, which have been successfully applied for classical media types like audio, images and videos, have...
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments (2005)
Hachenberger, Peter, Kettner, Lutz, Kobbelt, Leif, Shapiro, Vadim
Nef polyhedra in $d$-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, mixed-dimensional...
Fast and Robust Detection of Crest Lines on Meshes (2005)
Yoshizawa, Shin, Belyaev, Alexander, Seidel, Hans-Peter, Kobbelt, Leif, Shapiro, Vadim
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and second-order...
Mesh Scissoring with Minima Rule and Part Salience (2005)
Lee, Yunjin, Lee, Seungyong, Shamir, Ariel, Cohen-Or, Daniel, Seidel, Hans-Peter, Kobbelt, Leif
A survey of point-based techniques in computer graphics (2004)
In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of highly complex...
Optimized Sub-Sampling of Point Sets for Surface Splatting (2004)
Using surface splats as a rendering primitive has gained increasing attention recently due to its potential for high-performance and high-quality rendering of complex geometric models. However, as...
Topologically Correct Extraction of the Cortical Surface of a Brain Using Level-Set Methods (2004)
Stephan Bischoff, Leif Kobbelt
In this paper we present a level-set framework for accurate and efficient extraction of the surface of a brain from MRI data. To prevent the so-called partial volume effect we use a topology...
A survey of point-based techniques in computer graphics (2004)
In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of highly complex...
Sub-Voxel Topology Control for Level-Set Surfaces (2003)
Stephan Bischoff, Leif Kobbelt
Active contour models are an efficient, accurate, and robust tool for the segmentation of 2D and 3D image data. In particular, geometric deformable models (GDM) that represent an active contour as...
Sub-Voxel Topology Control for Level-Set Surfaces (2003)
Stephan Bischoff, Leif Kobbelt
Active contour models are an efficient, accurate, and robust tool for the segmentation of 2D and 3D image data.
citizen of Germany accepted on the recommendation of (2003)
Mark Pauly, Prof Dr, Markus Gross, Prof Dr, Leif Kobbelt, Prof Dr, ...
3D geometry has become increasingly popular as a new form of digital media. Similar to other types of media data, i.e., sound, images, and video, this requires tools to acquire, store, process, edit,...
High-Quality Point-Based Rendering on Modern GPUs (2003)
In the last years point-based rendering has been shown to offer the potential to outperform traditional triangle based rendering both in speed and visual quality when it comes to processing highly...
Towards Robust Broadcasting of Geometry Data (2002)
Stephan Bischoff, Leif Kobbelt
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric object even if parts...
Efficient high quality rendering of point sampled geometry (2002)
Mario Botsch, Andreas Wiratanaya, Leif Kobbelt
We propose a highly efficient hierarchical representation for point sampled geometry that automatically balances sampling density and point coordinate quantization. The representation is very compact...
Streaming 3D Geometry Data Over Lossy Communication Channels (2002)
Stephan Bischoff, Leif Kobbelt
In this paper we propose a progressive 3D geometry transmission technique that is robust with respect to data loss. In a preprocessing step we decompose a given polygon mesh model into a set of...
Simplification and compression of 3d meshes (2002)
Craig Gotsman, Stefan Gumhold, Leif Kobbelt
Abstract. We survey recent developments in compact representations of 3D mesh data. This includes: Methods to reduce the complexity of meshes by simplification, thereby reducing the number of...
Efficient high quality rendering of point sampled geometry (2002)
Mario Botsch, Andreas Wiratanaya, Leif Kobbelt
We propose a highly efficient hierarchical representation for point sampled geometry that automatically balances sampling density and point coordinate quantization. The representation is very compact...
Geometric fairing of irregular meshes for free-form surface design (2001)
Robert Schneider, Leif Kobbelt
In this paper we present a new algorithm for smoothing arbitrary triangle meshes while satisfying ¢ ¡ boundary conditions. The algorithm is based on solving a non-linear fourth order partial...
Line-Art Rendering of 3D-Models (2000)
We present an interactive system for computer aided generation of line art drawings to illustrate 3D models that are given as triangulated surfaces. In a preprocessing step an enhanced 2D view of the...
Generating Fair Meshes with G¹ Boundary Conditions (2000)
Robert Schneider, Leif Kobbelt
In this paper we present a new algorithm to create fair discrete surfaces satisfying prescribed G 1 boundary constraints. All surfaces are built by discretizing a partial differential equation based...
A new stationary subdivision scheme is presented which performs slower topological refinement than the usual dyadic split operation. The number of triangles increases in every step by a factor of 3...
Line Art Rendering of Triangulated Surfaces Using Discrete Lines of Curvature (2000)
Christian Rössl, Leif Kobbelt, Hans-peter Seidel
In recent years, several techniques have been proposed for automatically producing line-art illustrations. In this paper a new non photo-realistic rendering scheme for triangulated surfaces is...
Deformable surfaces for feature based indirect volume rendering (1998)
Christoph Lurig, Leif Kobbelt, Thomas Ertl
In this paper we present an indirect volume visualization method, based on the deformable surface model, which is a three dimensional extension of the snake segmentation method. In contrast to...
Fairing by Finite Difference Methods (1998)
Abstract. We propose an efficient and flexible scheme to fairly interpolate or approximate the vertices of a given triangular mesh. Instead of generating a piecewise polynomial representation, our...
A general framework for mesh decimation (1998)
Leif Kobbelt, Swen Campagna, Hans-peter Seidel
The decimation of highly detailed meshes has emerged as an important issue in many computer graphics related fields. A whole library of different algorithms has been proposed in the literature. By...
Interactive Multi-Resolution Modeling on Arbitrary Meshes (1998)
Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-peter Seidel
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful...
Directed edges - a scalable representation for triangle meshes (1998)
Swen Campagna, Leif Kobbelt, Hans-peter Seidel
In a broad range of computer graphics applications the representation of geometric shape is based on triangle meshes. General purpose data structures for polygonal meshes typically provide fast...
Interactive Multi-Resolution Modeling on Arbitrary Meshes (1998)
Leif Kobbelt Swen, Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-peter Seidel
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful...
Enhancing Digital Documents by including 3D-Models (1998)
Swen Campagna, Leif Kobbelt, Hans-peter Seidel
Due to their simplicity, triangle meshes are used to represent geometric objects in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware...
Subdivision for Modeling and Animation (1998)
Peter Schröder, Peter Schr Oder, Denis Zorin, Tony Derose, David R. Forsey, ...
sis Denis Zorin and Jorg Peters Afternoon Session: Applications and Algorithms The afternoon session will focus on applications of subdivision and the algorithmic issues practitioners need to address...
A general framework for mesh decimation (1998)
Leif Kobbelt, Swen Campagna, Hans-peter Seidel
The decimation of highly detailed meshes has emerged as an important issue in many computer graphics related fields. A whole library of different algorithms has been proposed in the literature. By...
Interactive Multi-Resolution Modeling on Arbitrary Meshes (1998)
Leif Kobbelt Swen, Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-peter Seidel
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful...
Iterative Mesh Generation for FE-computation on Free Form Surfaces (1997)
Leif Kobbelt, Torsten Hesse, Hartmut Prautzsch, Karl Schweizerhof
We present an interpolatory subdivision scheme to generate adaptiely refined quadrilateral meshes which approximate a smooth surface of arbitrary topology. The described method significantly differs...
Using subdivision on hierarchical data to reconstruct radiosity distribution (1997)
Leif Kobbelt, Marc Stamminger, Hans-peter Seidel
Computing global illumination by finite element techniques usually generates a piecewise constant approximation of the radiosity distribution on surfaces. Directly displaying such scenes generates...
We address the general problem of, given a triangular net of arbitrary topology
Robust and Efficient Evaluation of Functionals on Parametric Surfaces (1997)
ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications...
Variational Design with Parametric Meshes of Arbitrary Topology (1997)
: Many mathematical problems in geometric modeling are merely due to the difficulties of handling piecewise polynomial parameterizations of surfaces (e.g., smooth connection of patches, evaluation of...
A Variational Approach to Subdivision (1996)
In this paper a new class of interpolatory refinement schemes is presented which in every refinement step determine the new points by solving an optimization problem. In general, these schemes are...
Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology (1996)
A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satisfies important requirements for...
Stable Evaluation of Box Splines (1996)
The most elegant way to evaluate box-splines is by using their recursive definition. However, a straightforward implementation reveals numerical difficulties. A careful analysis of the algorithm...
Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology (1996)
A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satis es important requirements for...
Using Simulated Annealing to Obtain Good Nodal Approximations of Deformable Bodies (1995)
Oliver Deussen, Leif Kobbelt, Peter Tücke
. In this paper we present a method to obtain good approximations of deformable bodies with spring/mass systems. An iterative algorithm basedon voronoi diagrams is used to get a good mass...
Using Simulated Annealing to Obtain Good (1995)
Nodal Approximations Of, Oliver Deussen, Leif Kobbelt, Peter Tücke
In this paper we present a method to obtain good approximations of deformable bodies with spring/mass systems. An iterative algorithm basedon voronoi diagrams is used to get a good mass distribution....
A Fast Dot-Product Algorithm with Minimal Rounding Errors (1994)
Mit Minimalem Rundungsfehler, Leif Kobbelt
We present a new algorithm which computes dot-products of arbitrary length with minimal rounding errors, independent of the number of addends. The algorithm has an O(n) time and O(1) memory...
Directed Edges - A Scalable Representation for Triangle Meshes
Swen Campagna, Leif Kobbelt, Hans-peter Seidel
In a broad range of computer graphics applications the representation of geometric shape is based on triangle meshes. General purpose data structures for polygonal meshes typically provide fast...
Using the Discrete Fourier-Transform to Analyze the Convergence of Subdivision Schemes
While the continuous Fourier transform is a well-established standard tool for the analysis of subdivision schemes, we present a new technique based on the discrete Fourier transform instead. We...