#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1957

2017

- This year (2)
- Last 5 years (20)
- Last 10 years (58)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Data Set Used

#### Organism

Learn More

- Michael Garland, Paul S. Heckbert
- SIGGRAPH
- 1997

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â€¦ (More)

- John Nickolls, Ian Buck, Michael Garland, Kevin Skadron
- 2008 IEEE Hot Chips 20 Symposium (HCS)
- 2008

The advent of multicore CPUs and manycore GPUs means that mainstream processor chips are now parallel systems. Furthermore, their parallelism continues to scale with Moore's law. The challenge is toâ€¦ (More)

- Nathan Bell, Michael Garland
- Proceedings of the Conference on High Performanceâ€¦
- 2009

Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations encounter a broadâ€¦ (More)

The massive parallelism of graphics processing units (GPUs) offers tremendous performance in many high-performance computing applications. While dense linear algebra readily maps to such platforms,â€¦ (More)

- Nadathur Satish, Mark J. Harris, Michael Garland
- 2009 IEEE International Symposium on Parallelâ€¦
- 2009

We describe the design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the full programmability offered by CUDA. Our radix sort is the fastestâ€¦ (More)

- Duane Merrill, Michael Garland, Andrew S. Grimshaw
- PPOPP
- 2012

Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms. It is also representative of a class of parallel computations whoseâ€¦ (More)

- Michael Garland, Paul S. Heckbert
- IEEE Visualization
- 1998

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â€¦ (More)

Many applications in computer graphics and related fields can benefit from automatic simplification of complex polygonal surface models. Applications are often confronted with either very denselyâ€¦ (More)

Several algorithms for approximating terrains and other height fields using polygonal meshes are described, compared, and optimized. These algorithms take a height field as input, typically aâ€¦ (More)

- Christian Lauterbach, Michael Garland, Shubhabrata Sengupta, David P. Luebke, Dinesh Manocha
- Comput. Graph. Forum
- 2009

We present two novel parallel algorithms for rapidly constructing bounding volume hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton codes to build hierarchiesâ€¦ (More)