Realtime Loop subdivision on the GPU

Minho Kim; Jörg Peters

doi:10.1145/1186954.1187093

Realtime Loop subdivision on the GPU

Minho Kim, Jörg Peters

Department of Computer Science and Engineering

University of Florida

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

Recently, [1] showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. The authors tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at nearrealtime speed. Here, we report on adapting the approach to Loop subdivision, discussing challenges we encountered.

Original language	English
Pages	123
Number of pages	1
DOIs	https://doi.org/10.1145/1186954.1187093
State	Published - 31 Jul 2005
Event	International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2005 - Los Angeles, United States Duration: 31 Jul 2005 → 4 Aug 2005

Conference

Conference	International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2005
Country/Territory	United States
City	Los Angeles
Period	31/07/05 → 4/08/05

Access to Document

10.1145/1186954.1187093

Cite this

@conference{008b1a1c6e0e460ab33cf0229f2f5a76,

title = "Realtime Loop subdivision on the GPU",

abstract = "Recently, [1] showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. The authors tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at nearrealtime speed. Here, we report on adapting the approach to Loop subdivision, discussing challenges we encountered.",

author = "Minho Kim and J{\"o}rg Peters",

year = "2005",

month = jul,

day = "31",

doi = "10.1145/1186954.1187093",

language = "English",

pages = "123",

note = "International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2005 ; Conference date: 31-07-2005 Through 04-08-2005",

}

TY - CONF

T1 - Realtime Loop subdivision on the GPU

AU - Kim, Minho

AU - Peters, Jörg

PY - 2005/7/31

Y1 - 2005/7/31

N2 - Recently, [1] showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. The authors tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at nearrealtime speed. Here, we report on adapting the approach to Loop subdivision, discussing challenges we encountered.

AB - Recently, [1] showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. The authors tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at nearrealtime speed. Here, we report on adapting the approach to Loop subdivision, discussing challenges we encountered.

UR - http://www.scopus.com/inward/record.url?scp=84983120959&partnerID=8YFLogxK

U2 - 10.1145/1186954.1187093

DO - 10.1145/1186954.1187093

M3 - Paper

AN - SCOPUS:84983120959

SP - 123

T2 - International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2005

Y2 - 31 July 2005 through 4 August 2005

ER -

Realtime Loop subdivision on the GPU

Abstract

Conference

Access to Document

Other files and links

Cite this