Computational Geometry Seminar

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.

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…

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 / SoCG / FOCS / STOC /

ALENEX / WEA / ESA / ISAAC / SPAA / COCOON /STACS / ICALP / SIGGRAPH / PBG / EuroGraphics / IEEE Visualization / …

• TODO: Present one related paper from last year’s conference/journal list.

Time TableTopic Lecture Incharge

The Discrete Geodesic Problem

2nd Sep James McClain

Min Area Meshing 9th Sep Michale Connor

NetFlix 16th Polina

23rd Sep Samidh

30th Sep Arturo

7th Oct Alejandro

14th Oct Tomas

21st Oct

28th Oct

4th Nov

18 Nov

25th Nov

2nd Dec