Date of Award
Master of Science (MS)
Dr. Sanjukta Bhowmick
Dr. Robin Gandhi
Dr. Yulia Lierler
The subject of this thesis is mesh untangling through graph embedding, a method of laying out graphs on a planar surface, using an algorithm based on the work of Fruchterman and Reingold. Meshes are a variety of graph used to represent surfaces with a wide number of applications, particularly in simulation and modelling. In the process of simulation, simulated forces can tangle the mesh through deformation and stress. The goal of this thesis was to create a tool to untangle structured meshes of complicated shapes and surfaces, including meshes with holes or concave sides. The goals of graph embedding, such as minimizing edge crossings align very well with the objectives of mesh untangling. I have designed and tested a tool which I named MUT (Mesh Untangling Tool) on meshes of various types including triangular, polygonal, and hybrid meshes.
Previous methods of mesh untangling have largely been numeric or optimizationbased. Additionally, most untangling methods produce low quality graphs which must be smoothed separately to produce good meshes. Currently graph embedding techniques have only been used for smoothing of untangled meshes. I have developed a tool based on the Fruchterman-Reingold algorithm for force-directed layout that effectively untangles and smooths meshes simultaneously using graph embedding techniques. It can untangle complicated meshes with irregular polygonal frames, internal holes, and other complications that previous methods struggle with. The MUT does this by using several different approaches: untangling the mesh in stages from the frame in and anchoring the mesh at corner points to stabilize the untangling.
Quinn, Jake, "Applications of Graph Embedding in Mesh Untangling" (2017). Student Work. 2916.
A Thesis Presented to the Department of Computer Science and the Faculty of the Graduate College University of Nebraska In Partial Fulfillment of the Requirements for the Degree Masters of Science, Computer Science University of Nebraska at Omaha. Copyright 2017 Jake Quinn.