#### Filter Results:

- Full text PDF available (140)

#### Publication Year

1982

2017

- This year (9)
- Last 5 years (48)
- Last 10 years (113)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mathieu Desbrun, Mark Meyer, Peter Schröder, Alan H. Barr
- SIGGRAPH
- 1999

In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelity computer graphics objects using imperfectly-measured data… (More)

This paper proposes a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method, and… (More)

- Andrei Khodakovsky, Peter Schröder, Wim Sweldens
- SIGGRAPH
- 2000

We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the reduction of error in a compression setting. Using… (More)

- Peter Schröder, Wim Sweldens
- SIGGRAPH
- 1995

Wavelets have proven to be powerful bases for use in numerical analysis and signal processing. Their power lies in the fact that they only require a small number of coefficients to represent general functions and large data sets accurately. This allows compression and efficient computations. Classical constructions have been limited to simple domains such… (More)

- Aaron W. F. Lee, Wim Sweldens, Peter Schröder, Lawrence C. Cowsar, David P. Dobkin
- SIGGRAPH
- 1998

We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial parameterization is further improved through a hierarchical… (More)

- Jeffrey Bolz, Ian Farmer, Eitan Grinspun, Peter Schröder
- SIGGRAPH Courses
- 2003

Many computer graphics applications require high-intensity numerical simulation. We show that such computations can be performed efficiently on the GPU, which we regard as a full function <i>streaming</i> processor with high floating-point performance. We implemented two basic, broadly useful, computational kernels: a <i>sparse matrix conjugate gradient… (More)

- Isaac Chao, Ulrich Pinkall, Patrick Sanan, Peter Schröder
- ACM Trans. Graph.
- 2010

We advocate a simple geometric model for elasticity: <i>distance between the differential of a deformation and the rotation group</i>. It comes with rigorous differential geometric underpinnings, both smooth and discrete, and is computationally almost as simple and efficient as linear elasticity. Owing to its geometric non-linearity, though, it does not… (More)

- Igor Guskov, Wim Sweldens, Peter Schröder
- SIGGRAPH
- 1999

We generalize basic signal processing tools such as downsampling, upsampling, and filters to irregular connectivity triangle meshes. This is accomplished through the design of a non-uniform relaxation procedure whose weights depend on the geometry and we show its superiority over existing schemes whose weights depend only on connectivity. This is combined… (More)

- Boris Springborn, Peter Schröder, Ulrich Pinkall
- ACM Trans. Graph.
- 2008

We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of <i>discrete conformal equivalence</i> for triangle meshes which mimics the notion of conformal equivalence for smooth surfaces. The problem of finding a flat mesh that is discretely conformally equivalent to a given mesh can be solved efficiently by minimizing… (More)

Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match the original data exactly, and play an important role in fast… (More)