1. Computational Geometry Seminar

2. Computational Geometry Design and analysis of algorithms involving geometric IO. Has been an active area since late 70s. Deals with discrete nature of geometric problems, as opposed to continuous issues.

3. Computational Geometry Its tough to define an entire area which lies in Math ∩ CS ∩ Application Areas. There are always things on the edge, that become central with time. We’ll move on and learn what we can…

4. Problems we study Nearest Neighbor Problem. – Points / Balls / Hierarchies. Surface Reconstruction. Road Network Problems. – Large Data Sets / Cache Issues. Learning problems. – Geometric Optimization Problems – Clustering / Pattern Recognition

5. Related Conferences/Journals DCG / IJCGA : Journals DCGIJCGA Conferences: SODA / SoCG / FOCS / STOC / ALENEX / WEA / ESA / ISAAC / SPAA / COCOON /STACS / ICALP / SIGGRAPH / PBG / EuroGraphics / IEEE Visualization / … Conferences TODO: Present one related paper from last year’s conference/journal list.

6. Time Table TopicLectureIncharge The Discrete Geodesic Problem 2 nd SepJames McClain Min Area Meshing9 th SepMichale Connor NetFlix16 th Polina 23 rd SepSamidh 30 th SepArturo 7 th OctAlejandro 14 th OctTomas 21 st Oct 28 th Oct 4 th Nov 18 Nov 25 th Nov 2 nd Dec