Back to search

University of South Florida

Efficient Algorithms and Applications in Topological Data Analysis

Abstract

dc:description

Topological Data Analysis (TDA) is a new and fast growing research field developed over last two decades. TDA finds many applications in computer vision, computer graphics, scientific visualization, molecular biology, and material science, to name a few. In this dissertation, we make algorithmic and application contributions to three data structures in TDA: contour trees, Reeb graphs, and Mapper. From the algorithmic perspective, we design a parallel algorithm for contour tree construction and implement it in OpenCL. We also design and implement critical point pairing algorithms to compute persistence diagrams directly from contour trees, Reeb graphs, and Mapper. In terms of applications, we apply TDA in the design and implementation of an image enhancement application using contour trees. Lastly, we introduce an application of Mapper and persistent homology in model quality assessment for 3D printing.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (Ph.D.)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Computer Science and Engineering
Grantor
University of South Florida
Year dc:date
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tu, Junyi
Contributors dc:contributor
  • Paul Rosen, Ph.D.
  • Les Piegl, Ph.D.
  • Yicheng Tu, Ph.D.
  • Zhuo Lu, Ph.D.
  • Dmytro Savchuk, Ph.D.

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.usf.edu/etd/8083

Chain of custody

source
Harvested from
University of South Florida
Base URL
digitalcommons.usf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Tu, Junyi. Efficient Algorithms and Applications in Topological Data Analysis. Dissertation thesis, University of South Florida, 2016. https://digitalcommons.usf.edu/etd/8083