Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Michael Garland is active.

Publication


Featured researches published by Michael Garland.


international conference on computer graphics and interactive techniques | 1997

Surface simplification using quadric error metrics

Michael Garland; Paul S. Heckbert

Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with respect to geometric error. In order to allow topological joining, our system also supports non-manifold surface models. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—surface and object representations


ieee visualization | 1998

Simplifying surfaces with color and texture using quadric error metrics

Michael Garland; Paul S. Heckbert

There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.


Computational Geometry: Theory and Applications | 1999

Optimal triangulation and quadric-based surface simplification

Paul S. Heckbert; Michael Garland

Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produce. Previously we described an algorithm that simplifies polygonal models using a quadric error metric. This method is fast and produces high quality approximations in practice. Here we provide some theory to explain why the algorithm works as well as it does. Using methods from differential geometry and approximation theory, we show that in the limit as triangle area goes to zero on a differentiable surface, the quadric error is directly related to surface curvature. Also, in this limit, a triangulation that minimizes the quadric error metric achieves the optimal triangle aspect ratio in that it minimizes theL2 geometric error. This work represents a new theoretical approach for the analysis of simplification algorithms.


eurographics | 1999

Face cluster radiosity

Andrew J. Willmott; Paul S. Heckbert; Michael Garland

An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolution modelling. A new face clustering technique for automatically partitioning polygonal models is used. The face clusters produced group adjacent triangles with similar normal vectors. They are used during radiosity solution to represent the light reflected by a complex object at multiple levels of detail. Also, the radiosity method is reformulated in terms of vector irradiance and power. Together, face clustering and the vector formulation of radiosity permit large savings. Excessively fine levels of detail are not accessed by the algorithm during the bulk of the solution phase, greatly reducing its memory requirements relative to previous methods. Consequently, the costliest steps in the simulation can be made sub-linear in scene complexity. Using this algorithm, radiosity simulations on scenes of one million input polygons can be computed on a standard workstation.


Archive | 1997

Survey of Polygonal Surface Simplification Algorithms

Paul S. Heckbert; Michael Garland


eurographics | 1999

Multiresolution Modeling: Survey and Future Opportunities

Michael Garland


Archive | 1998

Fast Polygonal Approximation of Terrains and Height Fields

Michael Garland


Archive | 1999

Quadric-based polygonal surface simplification

Michael Garland; Paul S. Heckbert


GI | 1999

Multiresolution Modeling for Fast Rendering

Paul S. Heckbert; Michael Garland


Archive | 1997

Simplification Using Quadric Error Metrics

Michael Garland; Paul S. Heckbert

Collaboration


Dive into the Michael Garland's collaboration.

Top Co-Authors

Avatar

Paul S. Heckbert

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Robert T. Monroe

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Sebastian Grassia

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Siddhartha Puri

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge