Back to search

Clemson University

PARALLEL √3-SUBDIVISION with ANIMATION in CONSIDERATION of GEOMETRIC COMPLEXITY

Abstract

dc:description.abstract

We look at the broader field of geometric subdivision and the emerging field of parallel computing for the purpose of creating higher visual fidelity at an efficient pace. Primarily, we present a parallel algorithm for √3-Subdivision. When considering animation, we find that it is possible to do subdivision by providing only one variable input, with the rest being considered static. This reduces the amount of data transfer required to continually update a subdividing mesh. We can support recursive subdivision by applying the technique in passes. As a basis for analysis, we look at performance in an OpenCL implementation that utilizes a local graphics processing unit (GPU) and a parallel CPU. By overcoming current hardware limitations, we present an environment where general GPU computation of √3-Subdivision can be practical.

Degree

thesis:*
Name thesis:degree_name
Master of Fine Arts (MFA)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Digital Production Arts

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Cooney, Stephen
Contributors dc:contributor
  • House, Donald
  • Davis , Tim
  • Malloy , Brian

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/959

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Cooney, Stephen. PARALLEL √3-SUBDIVISION with ANIMATION in CONSIDERATION of GEOMETRIC COMPLEXITY. Thesis thesis, https://open.clemson.edu/all_theses/959