Presentations

(If you would like to work on a significant programming project instead, you would have to propose a suitable programming project yourself; please check with Carola prior to making such a decision.)

List of papers

Please click here for a list of papers for presentations, as well as for a list of conferences and journals in computational geometry.

Tentative Schedule

In class

• Monday, October 18: [Mahmuda Ahmed]
  Daniel Chen, Leonidas J. Guibas, John Hershbergery, Jian Sun, Road Network Reconstruction for Organizing Paths, SODA 2010, pages 1309-1320.
• Monday, October 25:
• Wednesday, October 27:
• Wednesday, November 3: [Xinran Yu] Zhengqing Yun, Zhijun Zhang, and Magdy F. Iskander, A Ray-Tracing Method Based on the Triangular Grid Approach and Application to Propagation Prediction in Urban Environments, IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 50, NO. 5, MAY 2002.
• Monday, November 8: [Robert Porter]
  Marco Lanzagorta and Jeffrey K. Uhlmann, Quantum computational geometry, Proc. of SPIE Vol 5436, 332, 2004.
• Wednesday, November 10:[Justin Leonard]
  Mark de Berg and Chris Gray, Computing the Visibility Map of Fat Objects, Computational Geometry (CGTA), Volume 43, Issue 4, , Pages 410-418, 2010.
• Monday, November 15:
• Wednesday, November 17: [Morteza Shahriari Nia]
  Yohji Akama, Kei Irie, Akitoshi Kawamura and Yasutaka Uwano, VC Dimensions of Principal Component Analysis, Discrete and Computational Geometry (DCG), Volume 44, Number 3, 589-598, 2010.
• Monday, November 22: [Hasan Ahmed]
  Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle, The Directed Hausdorff Distance between Imprecise Point Sets, In ISAAC, 2009.
• Wednesday, November 24: [Faizur Rahman]
  Boris Aronov, Marc van Kreveld, Maarten Löffler and Rodrigo I. Silveira, Peeling Meshed Potatoes, Algorithmica, Online First 2009.
• Monday, November 29: [Kevin Baldor]
  Alon Efrat, Sandor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, and Jukka Suomela.Improved Approximation Algorithms for Relay Placement , ALGORITHMS - ESA, Lecture Notes in Computer Science, 2008, Volume 5193/2008, 356-367, 2008.
• Wednesday, December 1: [Gayani Samaraweera]
  Ciprian S. Borcea and Ileana Streinu, How far can you reach? in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA10), 928-937, Austin, Texas, 2010.

During the final exam period on Wednesday 12/8, 5pm-7:30pm

• 5pm - 5:25pm: [Jamiul Jahid]
  Suzanne Sindi1, Elena Helman, Ali Bashir, Benjamin J. Raphael, A geometric approach for classification and comparison of structural variants, Bioinformatics, Volume25, Issue 12, Pp. i222-i230.
• 5:25pm - 5:50pm: [Arif Bin Hossain]
  Moshe Dror, Alon Efrat, Anna Lubiw, and Joseph S. B. Mitchell, Touring a Sequence of Polygons, Proc. 35th ACM Symposium on Theory of Computing (STOC 2003), San Diego, CA, June 9-11, 2003, pp. 473--482.
• 5:50pm - 6:15pm: [Mohammad Islam]
  Yoav Amit, Joseph S. B. Mitchell, and Eli Packer. Locating Guards for Visibility Coverage of Polygons, Proc. Ninth Workshop on Algorithm Engineering and Experiments (ALENEX'07), pp.~120-134, Proceedings in Applied Mathematics. SIAM, 2007.
• 6:15pm - 6:40pm: [Navid Pustchi]
  Alon Efrat, Sariel Har-Peled, and Joseph Mitchell, Approximation Algorithms for Two Optimal Location Problems in Sensor Networks, Proc. BroadNets 2005: Second International Conference on Broadband Networks.
• 6:40pm - 7:05pm: [Tanzir Musabbir] Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell and Arik Sityon, Finding Large Sticks and Potatoes in Polygons, Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, 2006.
• 7:05pm - 7:30pm: [Yiming Han]
  S. Khuller and Y. Matias, A Simple Randomized Sieve Algorithm for the Closest-Pair Problem, Information and Computation, Vol 188 (1), pp. 34--37, (1995).

In the office

• Week of November 1: (2 slots)
• Week of November 8: (2 slots)
• Week of November 15:
  [Ali Tekeoglu] Hervé Brönnimann, Timothy M. Chan, Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time, CGTA, Volume 34, Issue 2, Pages 75-82, 2006.
  [Nazul Grimaldo] Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl, Divide-and-conquer for Voronoi diagrams revisited , CGTA, Volume 43, Issue 8, Pages 688-699, 2010.
• Week of November 22:
  [Vicente Ferrer] Amitabh Basu, Joseph S. B. Mitchell, and Girishkumar Sabhnani.Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing, ALENEX 2008.
  [Husnu Narman] Paz Carmi, Matthew J. Katz, and Joseph S. B. Mitchell, The Minimum-Area Spanning Tree Problem, Proc. 9th Workshop Algorithms Data Struct., 2005, LNCS Vol. 3608, pages 195-204.
• Week of November 29: (1 free slot)
  [Jichi Guo]
  A. Gonzalez-Escribano, D. Llanos, D. Orden, B. Palop, Parallelization alternatives and their performancenext term for the previous termconvex hull problemnext term, Applied Mathematical Modelling Volume 30, Issue 7, July 2006, Pages 563-577.
  [Sean Pivek]
  T. K. Dey, J. A. Levine, and A. Slatton, Localized Delaunay refinement for sampling and meshing, Computer Graphics Forum. Vol. 29 (5), 1723--1732. Specail issue of Proc. Eurographics Sympos. Geometry Processing. (SGP 2010).
• Week of December 6: (several free slots)
  [Adam Duncan]
  Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Covering a simple polygon by monotone directions, In Comput. Geom., volume 43, 2010.
  [Chad Zalkin]
  C. Silva, J.S.B. Mitchell, and A. Kaufman, ``Fast Rendering of Irregular Grids'' , ACM-IEEE Symposium on Volume Visualization (VolVis'96), San Francisco, CA, Oct 28-29, 1996, pages 15-22.