Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Practicality of Discrete Laplace Operators

Thangudu, Kedarnath

Abstract Details

2009, Master of Science, Ohio State University, Computer Science and Engineering.
One of the key topics in computer graphics and geometric optimization is surface representation and processing. Many recent advances in these areas are based on the Laplace-Beltrami operator on a surface. Discrete approximations of the operator such as the cotangent scheme are popular in applications like shape approximation and compact representation, mesh editing, surface smoothing, shape interpolation, watermarking etc. Belkin et al proposed a new algorithm for approximating the Laplace operator on a surface mesh with point-wise convergence, which, is not guaranteed in the cotangent schemes. In this thesis, we present an experimental study on how the performance of this method and its variants compare to that of the cotangent scheme under various scenarios like noise, boundary and sampling conditions. We use the diffusion distance metric to study the stability and the ground truth to measure the accuracy of these methods.
Yusu Wang, PhD (Advisor)
Tamal Dey, PhD (Committee Member)
49 p.

Recommended Citations

Citations

  • Thangudu, K. (2009). Practicality of Discrete Laplace Operators [Master's thesis, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1236615194

    APA Style (7th edition)

  • Thangudu, Kedarnath. Practicality of Discrete Laplace Operators. 2009. Ohio State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1236615194.

    MLA Style (8th edition)

  • Thangudu, Kedarnath. "Practicality of Discrete Laplace Operators." Master's thesis, Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1236615194

    Chicago Manual of Style (17th edition)