{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-9280"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-9280","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Efficient Algorithms and Applications in Topological Data Analysis","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Tu, Junyi"],"institution":"University of South Florida","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Dissertation","degree_discipline":"Computer Science and Engineering","degree_department":null,"school":null,"contributors":["Paul Rosen, Ph.D.","Les Piegl, Ph.D.","Yicheng Tu, Ph.D.","Zhuo Lu, Ph.D.","Dmytro Savchuk, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-07-15T07:00:00Z","date_published":"2016-07-15T07:00:00Z","updated_at":"2026-11-19T08:50:23Z","subjects":["Contour Trees","Image Enhancement","Parallel Computing","Persistent Pairing","Reeb Graphs","Computer Sciences","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/8083","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/8083","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-9280","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Paul Rosen, Ph.D.","Les Piegl, Ph.D.","Yicheng Tu, Ph.D.","Zhuo Lu, Ph.D.","Dmytro Savchuk, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Tu, Junyi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-07-15T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","Ph.D."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Contour Trees","Image Enhancement","Parallel Computing","Persistent Pairing","Reeb Graphs","Computer Sciences","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/8083"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:title","label":"Title","values":["Efficient Algorithms and Applications in Topological Data Analysis"]}]}],"canonical_facts":{"dc:contributor":["Paul Rosen, Ph.D.","Les Piegl, Ph.D.","Yicheng Tu, Ph.D.","Zhuo Lu, Ph.D.","Dmytro Savchuk, Ph.D."],"dc:creator":["Tu, Junyi"],"dc:date":["2016-07-15T07:00:00Z"],"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."],"dc:identifier":["https://digitalcommons.usf.edu/etd/8083"],"dc:subject":["Contour Trees","Image Enhancement","Parallel Computing","Persistent Pairing","Reeb Graphs","Computer Sciences","Mathematics"],"dc:title":["Efficient Algorithms and Applications in Topological Data Analysis"],"thesis:degree_discipline":["Computer Science and Engineering"],"thesis:degree_level":["Dissertation","Ph.D."],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:50:23Z"}