Show simple item record

dc.identifier.urihttp://hdl.handle.net/1951/59757
dc.identifier.urihttp://hdl.handle.net/11401/71032
dc.description.sponsorshipThis work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.en_US
dc.formatMonograph
dc.format.mediumElectronic Resourceen_US
dc.language.isoen_US
dc.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dc.typeDissertation
dcterms.abstractComputational 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.
dcterms.available2013-05-22T17:35:05Z
dcterms.available2015-04-24T14:45:38Z
dcterms.contributorJiao, Xiangminen_US
dcterms.contributorMitchell, Joseph S.B.en_US
dcterms.contributorArkin, Esther M.Gu, Xianfeng.en_US
dcterms.creatorLi, Yinghua
dcterms.dateAccepted2013-05-22T17:35:05Z
dcterms.dateAccepted2015-04-24T14:45:38Z
dcterms.dateSubmitted2013-05-22T17:35:05Z
dcterms.dateSubmitted2015-04-24T14:45:38Z
dcterms.descriptionDepartment of Applied Mathematics and Statisticsen_US
dcterms.extent87 pg.en_US
dcterms.formatApplication/PDFen_US
dcterms.formatMonograph
dcterms.identifierLi_grad.sunysb_0771E_11072en_US
dcterms.identifierhttp://hdl.handle.net/1951/59757
dcterms.identifierhttp://hdl.handle.net/11401/71032
dcterms.issued2012-08-01
dcterms.languageen_US
dcterms.provenanceMade available in DSpace on 2013-05-22T17:35:05Z (GMT). No. of bitstreams: 1 Li_grad.sunysb_0771E_11072.pdf: 758971 bytes, checksum: 53f930eec2f593d22bd17fb0d4e3be0f (MD5) Previous issue date: 1en
dcterms.provenanceMade available in DSpace on 2015-04-24T14:45:38Z (GMT). No. of bitstreams: 3 Li_grad.sunysb_0771E_11072.pdf.jpg: 1894 bytes, checksum: a6009c46e6ec8251b348085684cba80d (MD5) Li_grad.sunysb_0771E_11072.pdf.txt: 88241 bytes, checksum: 030fcc970962f48234aa1d0ebf91b6a1 (MD5) Li_grad.sunysb_0771E_11072.pdf: 758971 bytes, checksum: 53f930eec2f593d22bd17fb0d4e3be0f (MD5) Previous issue date: 1en
dcterms.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dcterms.subjectApplied mathematics
dcterms.subjectDelaunay refinement, discrete Ricci flow, hyperbolic plane, shortest word
dcterms.titleAlgorithms in Computational Conformal Geometry
dcterms.typeDissertation


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record