This course is intended to provide a meeting place for FSU Computational Geometry enthusiasts. We plan to meet once a week. Most of the weeks, an informal paper presentation will be done. One person is responsible each time for leading the discussions. Nobody will have to lead for more than one paper per semester. Everyone is welcome to attend. You can get one credit for participating by simply registering for CIS4930/5930. You will be required to present one paper, and attend on a somewhat regular basis. This is a excellent opportunity for students looking for learning upcoming tools in computational geometry/ graphics/machine learning.

1. Introduction
2. The discrete Geodesic problem by James McClain.
3. Minimum Area Meshing by Michael Connor
4. NetFlix Prediction Problem by Polina Volkova
5. Voronoi on Maps by Samidh Chatterjee
6. Spectral Clustering by Arturo Donate
7. Approximate Delaunay by Alejandro Cabrera
8. Open Problem Session
9. Shortest Paths in Maps by Andrew Rodriguez
10. Graph Reachability by Jefferey Jestes
11. Clustering on Maps by Tomas Mann
12. WSPD by Samidh Chatterjee