L. Kobbelt, P. Schröder, F. Losasso, S. Schaefer, J. Warren
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...
Improved Curvature Estimation on Triangular Meshes (2008)
L. Kobbelt, P. Schröder, T. Gatzke, C. Grimm
This paper takes a systematic look at several techniques for calculating curvature of a surface that is represented by a triangular mesh. Both discrete curvature approximation techniques and surface...
Global Conformal Surface Parameterization (2008)
L. Kobbelt, P. Schröder, Xianfeng Gu, Shing-tung Yau
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...
Global Conformal Surface Parameterization (2008)
L. Kobbelt, P. Schröder, Xianfeng Gu, Shing-tung Yau
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...
Estimation on Triangular Meshes (2008)
L. Kobbelt, P. Schröder, T. Gatzke, C. Grimm
This paper takes a systematic look at calculating the curvature of surfaces represented by triangular meshes. We have developed a suite of test cases for assessing the sensitivity of curvature...
OpenSG Symposium (2003) D. Reiners (Editor) API Design for Adaptive Subdivision Schemes (2008)
A. Sovakar, A. Von Studnitz, L. Kobbelt
We present an API for adaptive subdivision schemes which is generic in the sense that it allows to define a composite subdivision operator as a sequence of atomic splitting and averaging rules. The...
Publication in the Proceedings of Vision, Modeling, and (2008)
Author(s) Rita Borgo, David Duke, Malcolm Wallace, Edited T. Aach, C. Bischof, L. Kobbelt, ...
Copyright to the above work (including without limitation, the right to publish the work in whole or in part in any and all forms of media, now or hereafter known) is owned by the editors of Vision,...
Geometry Compression of Normal Meshes Using Rate-Distortion Algorithms (2008)
L. Kobbelt, P. Schröder, Sridhar Lavu, Hyeokho Choi, Richard Baraniuk
We propose a new rate-distortion based algorithm for compressing 3D surface geometry represented using triangular normal meshes. We apply the Estimation-Quantization (EQ) algorithm to compress normal...
Estimating Differential Quantities Using Polynomial Fitting of Osculating Jets (2008)
L. Kobbelt, P. Schröder, F. Cazals, M. Pouget
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...
Domain Decomposition for Multiresolution Analysis (2008)
This paper describes a method for converting an arbitrary mesh with irregular connectivity to a semi-regular multiresolution representation. A shape image encoding geometric and differential...
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...
Approximate implicitization via curve fitting (2008)
L. Kobbelt, P. Schröder, E. Wurm, B. Jüttler
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...
Statistical Point Geometry (2008)
L. Kobbelt, P. Schröder, Aravind Kalaiah, Amitabh Varshney
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...
for three-dimensional non-manifold objects (2008)
L. Kobbelt, P. Schröder, Leila De Floriani, Annie Hui
A scalable data structure
and Object Modeling — Boundary representations. (2008)
L. Kobbelt, P. Schröder, J-d Boissonnat, S. Oudot
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point ” technique proposed by Chew. Given a surface S, it progressively adds points on S and updates...
Stellar Subdivision Grammars (2008)
L. Kobbelt, P. Schröder, Luiz Velho, Matematica Pura Aplicada
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...
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...
Eurographics Symposium on Geometry Processing (2003) (2008)
L. Kobbelt, P. Schröder, Raphaëlle Chaine
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,...
L. Kobbelt, P. Schröeder, Marco Attene, Bianca Falcidieno, Jarek Rossignac, Michela Spagnuolo
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...
Multi-Chart Geometry Images (2008)
L. Kobbelt, P. Schröder, Z. J. Wood, S. J. Gortler, J. Snyder
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...
L. Kobbelt, P. Schröder, F. Losasso, S. Schaefer, J. Warren
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...
3D Reconstruction Using Labeled Image Regions (2008)
L. Kobbelt, P. Schröder, Remo Ziegler, Wojciech Matusik, Hanspeter Pfister, Leonard Mcmillan
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...
L. Kobbelt, P. Schröder, F. Losasso, S. Schaefer, J. Warren
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...
Mesh Forging: Editing of 3D-Meshes Using Implicitly Defined (2008)
L. Kobbelt, P. Schröder, G. H. Bendels, R. Klein
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...
L. Kobbelt, P. Schröder, Miguel A. Otaduy, Ming C. Lin
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...
Efficient Max-Norm Distance Computation and Reliable Voxelization (2007)
L. Kobbelt, P. Schröder, Gokul Varadhan, Shankar Krishnan, Young J. Kim, Suhas Diggavi, ...
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...
Skeleton Extraction of 3D Objects with Visible Repulsive Force (2007)
L. Kobbelt, P. Schröder, Fu-che Wu, Wan-chun Ma, Ping-chou Liou, Rung-huei Liang, ...
Skeleton should be the reduced object representation that conforms to human visual perception, and is very useful in applications such as object matching, mesh representation, computer animation,...
Approximating and Intersecting Surfaces from Points (2007)
L. Kobbelt, P. Schröder, Anders Adamson Ý, Marc Alexa Þ
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...
Mesh Forging: Editing of 3D-Meshes Using Implicitly Defined (2007)
L. Kobbelt, P. Schrder, G. H. Bendels, R. Klein
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...
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Abstract (2007)
L. Kobbelt, P. Schröder, Michael Kazhdan, Thomas Funkhouser, Szymon Rusinkiewicz
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...
Eurographics Symposium on Geometry Processing (2003) (2007)
L. Kobbelt, P. Schröder, Explicit Surface Remeshing, Vitaly Surazhsky, Craig Gotsman
We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the family of local...
Simple Silhouettes for Complex Surfaces (2007)
L. Kobbelt, P. Schröder, D. Kirsanov, S. J. Gortler
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...
Optimization Techniques for Approximation with Subdivision Surfaces (2004)
P. Brunet, N. Patrikalakis (editors, M. Marinov, L. Kobbelt
We present a method for scattered data approximation with subdivision surfaces which actually uses the true representation of the limit surface as a linear combination of smooth basis functions...
A Geometric Database For Gene Expression Data (2003)
L. Kobbelt, P. Schröder, Tao Ju, Joe Warren, Gregor Eichele, Christina Thaller, ...
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...
Statistical Point Geometry (2003)
L. Kobbelt, P. Schröder, Aravind Kalaiah, Amitabh Varshney
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...
Discrete Fairing of Curves and Surfaces Based on Linear Curvature Distribution (2002)
In the planar case, one possibility to create a high quality curve that interpolates a given set of points is to use a clothoid spline, which is a curvature continuous curve with linear curvature...
Openmesh – a generic and efficient polygon mesh data structure (2002)
M. Botsch, S. Steinberg, S. Bischoff, L. Kobbelt, Rwth Aachen
We describe the implementation of a half-edge data structure for the static representation and dynamic handling of arbitrary polygonal meshes. The particular design of the data structures and classes...
Discrete Fairing of Curves and Surfaces Based on Linear Curvature Distribution (2000)
. In the planar case, one possibility to create a high quality curve that interpolates a given set of points is to use a clothoid spline, which is a curvature continuous curve with linear curvature...
Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces (1999)
R. Westermann, L. Kobbelt, T. Ertl
Recent advances in the technology of 3D sensors and in the performance of numerical simulations result in the generation of volume data at ever growing size. In order to allow real-time exploration...