Advancing Efficiency of Unstructured Mesh Processing With Localized Data Structures

Unstructured meshes are widely used to represent complex shapes and data in visualization tasks, such as medical imaging, engineering design, and geometric modeling. However, their unevenly distributed elements make them memory-intensive and time-consuming to process, especially as mesh sizes grow. This research focuses on improving the efficiency of processing large unstructured meshes by reducing memory usage and speeding up computations. This doctoral dissertation introduces three methods to address these challenges. The first approach divides the mesh into smaller partitions and processes it piece-by-piece, reducing memory requirements by up to 10 times. The second approach uses the processor's parallel computing capabilities to accelerate the processing speed, achieving up to 3 times faster performance while keeping low memory usage. The third approach combines the power of both the processor and the graphics card to further improve performance by offloading some computational tasks to the graphics card, resulting in nearly 3 times faster than previous methods. Together, these advancements make it easier and faster to work with large unstructured datasets in fields like medicine, engineering, geography, and material science. By improving the efficiency of unstructured mesh processing, this research enables scientists and engineers to analyze data more effectively, leading to better insights and discoveries.

Publication Details

Journal
TigerPrints (Clemson University)
Published
2025-05-01
Primary Topic
Education, Innovation and Language Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Advancing Efficiency of Unstructured Mesh Processing With Localized Data Structures

TigerPrints (Clemson University)
Education, Innovation and Language Studies
article

Advancing Efficiency of Unstructured Mesh Processing With Localized Data Structures

article en

Abstract

Unstructured meshes are widely used to represent complex shapes and data in visualization tasks, such as medical imaging, engineering design, and geometric modeling. However, their unevenly distributed elements make them memory-intensive and time-consuming to process, especially as mesh sizes grow. This research focuses on improving the efficiency of processing large unstructured meshes by reducing memory usage and speeding up computations. This doctoral dissertation introduces three methods to address these challenges. The first approach divides the mesh into smaller partitions and processes it piece-by-piece, reducing memory requirements by up to 10 times. The second approach uses the processor's parallel computing capabilities to accelerate the processing speed, achieving up to 3 times faster performance while keeping low memory usage. The third approach combines the power of both the processor and the graphics card to further improve performance by offloading some computational tasks to the graphics card, resulting in nearly 3 times faster than previous methods. Together, these advancements make it easier and faster to work with large unstructured datasets in fields like medicine, engineering, geography, and material science. By improving the efficiency of unstructured mesh processing, this research enables scientists and engineers to analyze data more effectively, leading to better insights and discoveries.

TigerPrints (Clemson University)
Openalex Percentile: Top 37%
Education, Innovation and Language Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.