DSpace Repository

Algorithms in Computational Conformal Geometry

Show simple item record

dc.contributor.advisor Mitchell, Joseph S.B. en_US
dc.contributor.author Li, Yinghua en_US
dc.contributor.other Department of Applied Mathematics and Statistics en_US
dc.date.accessioned 2013-05-22T17:35:05Z
dc.date.accessioned 2015-04-24T14:45:38Z
dc.date.available 2013-05-22T17:35:05Z
dc.date.available 2015-04-24T14:45:38Z
dc.date.issued 2012-08-01
dc.identifier Li_grad.sunysb_0771E_11072 en_US
dc.identifier.uri http://hdl.handle.net/1951/59757 en_US
dc.identifier.uri http://hdl.handle.net/11401/71032 en_US
dc.description 87 pg. en_US
dc.description.abstract Computational conformal geometry is an intersectional field combining modern geometry theories from pure mathematics with computational algorithms from computer science. In the first part of this dissertation, we firstly review a powerful tool in computational conformal geometry, the discrete surface Ricci flow, which is used to conformally deform the given Riemannian metric of a surface to a Riemannian metric according to a user defined Gaussian curvature on interior points and geodesic curvature along the boundaries. Using the discrete Ricci flow to embed the high genus surface into the hyperbolic plane, we propose an efficient algorithm to compute the shortest words for loops given on triangulated surface meshes. The design of this algorithm is inspired and guided by the work of Dehn and Birman-Series. In support of the shortest word algorithm, we also propose efficient algorithms to compute shortest paths and shortest loops under hyperbolic metrics using a novel technique, called transient embedding, to work with the universal covering space. In addition, we employ several techniques to relieve the numerical errors. Experimental results are given to demonstrate the performance in practice. In the second part, we introduce two Delaunay refinement algorithms which give quality meshes on two-dimensional hyperbolic Poincar&eacute disk in computing. These two Delaunay refinement algorithms are generalizations of Chew's second algorithm and Ruppert's refinement algorithm, both of them are based on the Planar Straight Line Graph (PSLG) in Euclidean geometry. By modifying some definitions and adding new constraints, these two algorithms can be applied to surface meshes embedded in the hyperbolic Poincar&eacute disk. The generalizations will work on global meshes, and termination of these two algorithms will be given under constraints. en_US
dc.description.sponsorship This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree. en_US
dc.format Monograph en_US
dc.format.medium Electronic Resource en_US
dc.language.iso en_US en_US
dc.publisher The Graduate School, Stony Brook University: Stony Brook, NY. en_US
dc.subject.lcsh Applied mathematics en_US
dc.subject.other Delaunay refinement, discrete Ricci flow, hyperbolic plane, shortest word en_US
dc.title Algorithms in Computational Conformal Geometry en_US
dc.type Dissertation en_US
dc.mimetype Application/PDF en_US
dc.contributor.committeemember Jiao, Xiangmin en_US
dc.contributor.committeemember Arkin, Esther M.Gu, Xianfeng. en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account