Computational Geometry Seminar Computational Geometry Design and analysis

Computational Geometry Seminar

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

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

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

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

Topic Time Table Lecture Incharge The Discrete Geodesic Problem 2 nd Sep James Mc. Clain Min Area Meshing 9 th Sep Michale Connor Net. Flix 16 th Polina 23 rd Sep Samidh 30 th Sep Arturo 7 th Oct Alejandro 14 th Oct Tomas 21 st Oct 28 th Oct 4 th Nov 18 Nov 25 th Nov 2 nd Dec