AngleAnalyzer: A Mesh Compression Algorithm by
Jeff Sember
Abstract: AngleAnalzyer is a triangle mesh compression algorithm. The performance of the algorithm is investigated, in terms of both mesh connectivity and geometry. Three techniques of encoding the vertices of the mesh are compared, including a novel angle + aspect ratio method, which is shown to consistently outperform the method of the original algorithm. Issues concerning the entropy encoding of the connectivity and geometry are also discussed.
Reference:


LeastSquares Meshes by
John Li
Abstract: This project provides a mean of reconstructing a smooth mesh using a connectivity graph and a set of points. The resulting mesh satisfies the leastsquares constraint. That is, each vertex lies in the centroid of its immediate neighbours. The geometry of the resulting mesh is obtained by solving a sparse linear system. As it will be discussed later in this document, LSmesh can be very helpful in aiding many areas of computer graphics.
Reference:



Point Matching Methods: Survey and Comparison by
Varun Jain and Xiaoxing Li
Abstract: Point/feature matching in 2D images has been well studied in the computer vision community. With the huge advancement in shape scanning and acquisition technology, feature matching has recently found usefulness in 3D shape matching and searching. We study the general problem of feature correspondence in 3D shapes represented by triangular meshes. This project is a survey and comparison of extending various 2D point matching algorithms to 3D data sets. Finally, we suggest several potential ways to extend these techniques for solving the general problem of feature correspondence in 3D shapes.
Selected reference:


Seabed Surface Reconstruction by
Vidya Kotamraju
Abstract: The objective of the project is to obtain an impression of the three dimensional seabed structure. The input is an ASCII representation of sonar data which is subject to interpolation before visualization. The implementation of the project is based on the quadtree guided interpolation which uses a two dimensional quadtree of the ping map in order to guide the three dimensional interpolation process. The algorithm used is taken from [1] and results are shown for both two dimensional and three dimensional data.
Reference:
