#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2005

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Felix Kälberer, Matthias Nieser, Konrad Polthier
- Comput. Graph. Forum
- 2007

We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, for example, by principal curvature frames. The parameter lines are globally continuous and allow a remeshing of the surface into quadrilaterals. The algorithm converts a given frame… (More)

- Max Wardetzky, Saurabh Mathur, Felix Kälberer, Eitan Grinspun
- Symposium on Geometry Processing
- 2007

Discrete Laplace operators are ubiquitous in applications spanning geometric modeling to simulation. For robustness and efficiency, many applications require discrete operators that retain key structural properties inherent to the continuous setting. Building on the smooth setting, we present a set of natural properties for discrete Laplace operators for… (More)

- Felix Kälberer, Konrad Polthier, Ulrich Reitebuch, Max Wardetzky
- Comput. Graph. Forum
- 2005

We introduce FreeLence, a novel and simple single-rate compression coder for triangle manifold meshes. Our method uses free valences and exploits geometric information for connectivity encoding. Furthermore, we introduce a novel linear prediction scheme for geometry compression of 3D meshes. Together, these approaches yield a significant entropy reduction… (More)

We present a novel algorithm for automatic parameterization of tube-like surfaces of arbitrary genus such as the surfaces of knots, trees, blood vessels, neurons, or any tubular graph with a globally consistent stripe texture. Mathematically these surfaces can be described as thickened graphs, and the calculated parameterization stripe will follow either… (More)

- Christoph von Tycowicz, Felix Kälberer, Konrad Polthier
- Comput. Graph. Forum
- 2011

Multiresolution meshes provide an efficient and structured representation of geometric objects. To increase the mesh resolution only at vital parts of the object, adaptive refinement is widely used. We propose a lossless compression scheme for these adaptive structures that exploits the parent-child relationships inherent to the mesh hierarchy. We use the… (More)

- Felix Kälberer, Konrad Polthier, Christoph von Tycowicz
- 2009 XXII Brazilian Symposium on Computer…
- 2009

We present a novel coder for lossless compression of adaptive multiresolution meshes that exploits their special hierarchical structure. The heart of our method is a new progressive connectivity coder that can be combined with leading geometry encoding techniques. The compressor uses the parent/child relationships inherent to the hierarchical mesh. We use… (More)

Connections provide a way to compare local quantities defined at different points of a geometric space. This thesis develops a discrete theory of connections that naturally leads to practical, efficient numerical algorithms for geometry processing. Our formulation is motivated by real-world applications where meshes may be noisy or coarsely discretized.… (More)

- Eitan Grinspun, Max Wardetzky, +5 authors Yiying Tong
- 2008

We describe a discrete model for the dynamics of thin flexible structures, such as hats, leaves, and aluminum cans, which are characterized by a curved undeformed configuration. Previously such thin shell models required complex continuum mechanics formulations and correspondingly complex algorithms. We show that a simple shell model can be derived… (More)

Triangle meshes are the basic primitives of computer graphics and many simulation algorithms. When representing complex shapes, detailed triangle meshes consume a large amount of storage in a raw data format. Increasing geometric detail in the computer aided design industry, the movie industry and in models produced by modern 3D scanners demand for… (More)

- ‹
- 1
- ›