| dc.identifier.uri | http://hdl.handle.net/1951/59580 | |
| dc.identifier.uri | http://hdl.handle.net/11401/71155 | |
| 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 | |
| dc.format.medium | Electronic Resource | en_US |
| dc.language.iso | en_US | |
| dc.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dc.type | Thesis | |
| dcterms.abstract | In this thesis I present an algorithm and its implementation for 2D and 3D simplicial mesh optimization. An energy function for each simplex of a mesh in R<super>n</super> , where 2 &le n &ge 3, is defined as the volume of the ideal hyperbolic simplex in R<super>n+1</super> constructed from the said simplex. It has been proven otherwise and mentioned here as well that a regular simplex has maximum energy. Thus maximizing this energy by reshaping each individual simplex of the mesh will improve the overall quality of the mesh. The algorithm maximizes this energy to achieve an optimal mesh by displacing vertices and updating connectivity of the mesh conforming to the delaunay property by following a gradient descent method. The details of the energy function, proof of correctness and implementation details are presented herewith. | |
| dcterms.available | 2013-05-22T17:34:11Z | |
| dcterms.available | 2015-04-24T14:46:12Z | |
| dcterms.contributor | Gu, Xianfeng D | en_US |
| dcterms.contributor | Gao, Jie | en_US |
| dcterms.contributor | Jiao, Xiangmin. | en_US |
| dcterms.creator | Bhagavatula, Phanindra | |
| dcterms.dateAccepted | 2013-05-22T17:34:11Z | |
| dcterms.dateAccepted | 2015-04-24T14:46:12Z | |
| dcterms.dateSubmitted | 2013-05-22T17:34:11Z | |
| dcterms.dateSubmitted | 2015-04-24T14:46:12Z | |
| dcterms.description | Department of Computer Science | en_US |
| dcterms.extent | 39 pg. | en_US |
| dcterms.format | Monograph | |
| dcterms.format | Application/PDF | en_US |
| dcterms.identifier | Bhagavatula_grad.sunysb_0771M_10922 | en_US |
| dcterms.identifier | http://hdl.handle.net/1951/59580 | |
| dcterms.identifier | http://hdl.handle.net/11401/71155 | |
| dcterms.issued | 2012-05-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Made available in DSpace on 2013-05-22T17:34:11Z (GMT). No. of bitstreams: 1
Bhagavatula_grad.sunysb_0771M_10922.pdf: 895346 bytes, checksum: 765370b24223bd71c578e2bd2ac5c1c0 (MD5)
Previous issue date: 1 | en |
| dcterms.provenance | Made available in DSpace on 2015-04-24T14:46:12Z (GMT). No. of bitstreams: 3
Bhagavatula_grad.sunysb_0771M_10922.pdf.jpg: 1894 bytes, checksum: a6009c46e6ec8251b348085684cba80d (MD5)
Bhagavatula_grad.sunysb_0771M_10922.pdf.txt: 44135 bytes, checksum: 68ee3dee51c845d9a097dcad9703211e (MD5)
Bhagavatula_grad.sunysb_0771M_10922.pdf: 895346 bytes, checksum: 765370b24223bd71c578e2bd2ac5c1c0 (MD5)
Previous issue date: 1 | en |
| dcterms.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dcterms.subject | Computer science | |
| dcterms.subject | Tetrahedralization, Triangulation, Variational Delaunay | |
| dcterms.title | Variational Delaunay Triangulation | |
| dcterms.type | Thesis | |
