Below is a list of papers for presentation. I will add more papers to this list during the semester. However, you may also look through the recent proceedings of the following main journals and conferences in Computational Geometry in order to find a suitable paper:

Journals and Conferences in Computational Geometry

• Journal of Computational Geometry (JoCG)
• Discrete and Computational Geometry (DCG)
• Computational Geometry: Theory and Applications (CGTA)
• Symposium on Computational Geometry (SoCG)
• Symposium on Discrete Algorithms (SODA) (make sure to pick a paper that is close to computational geometry)
• Algorithms and Data Structures Symposium (WADS) (make sure to pick a paper that is close to computational geometry)

Before choosing a paper please discuss your choice with the instructor.

Wireless Sensor Networks

• [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.
• [Baris Tas] Helmut Alt, Esther M. Arkin, Herve Bronnimann, Jeff Erickson, Sandor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, and Kim Whittlesey. Minimum-Cost Coverage of Point Sets by Disks, Proc. 22nd Annual ACM Symposium on Computational Geometry, pp. 449-458, 2006.
• [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.
• [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.

Esther M. Arkin, Joseph S. B. Mitchell, and Valentin Polishchuk.Maximum Thick Paths in Static and Dynamic Environments, Proc. 24th Annual ACM Symposium on Computational Geometry, June 2008.
• [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.

• [Mahmuda Ahmed] Daniel Chen, Leonidas J. Guibas, John Hershbergery, Jian Sun, Road Network Reconstruction for Organizing Paths, SODA 2010, pages 1309-1320.
• [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.
• [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.

• Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph, Interface surfaces for protein-protein complexes, Journal of the ACM (JACM) , Volume 53 Issue 3, 2006.
• [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. Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph, Interface surfaces for protein-protein complexes, Journal of the ACM (JACM) , Volume 53 Issue 3, 2006.
• L.J. Guibas and Yusu Wang, Towards Unsupervised Segmentation of Semi-rigid Low-resolution Molecular Surfaces , Algorithmica. 48 (4): 433--448 (Aug. 2007).
• P. K. Agarwal and N. Mustafa and Yusu Wang, Efficient Algorithms for Contact-map Overlap Problem , J. Comput. Biology (JCB) . 14 (2): 131--143 (Mar. 2007).

• [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.
• [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.
• Mark de Berg, Herman Haverkort, Constantinos P. Tsirogiannis, Visibility Maps of Realistic Terrains Have Linear Smoothed Complexity, Journal of Computational Geometry (JoCG), Vol 1, No 1, 2010.

• [Jessica Sherette] Buchin, K., Buchin, M. & Gudmundsson, J. (2010), Constrained Free Space Diagrams: a Tool for Trajectory Analysis, International Journal of Geographical Information Science. Vol. 24, pp. 1101-1125.
• J.M. Díaz-Báñez, M.A. López, M. Mora, C. Seara, I. Ventura, Fitting a two-joint orthogonal chain to a point set, Computational Geometry, Online, 2010.
• P. Agarwal, B. Aronov, M. van Kreveld, M. Löffler and R. I. Silveira., Computing Similarity between Piecewise-Linear Functions, In Proc. 26th ACM Symposium on Computational Geometry (SoCG), pages 375-383, 2010.
• [Hasan Ahmed] Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle, The Directed Hausdorff Distance between Imprecise Point Sets, In ISAAC, 2009.
• Helmut Alt, Ludmila Scharf, Daria Schymura, Probabilistic matching of planar regions, CGTA, Volume 43, Issue 2, Pages 99-114, 2010.
• Hee-Kap Ahn, Peter Brass, Chan-Su Shin, Maximum overlap and minimum convex hull of two convex polyhedra under translations, CGTA, Volume 40, Issue 2, pages 171-177, 2008.

• [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.
• Barequet, Gill; Vaxman, Amir., Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections, Computer Graphics Forum, Jul2009, Vol. 28 Issue 5, p1327-1337.
• [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).
• Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, and Li Zhang, On incremental rendering of silhouette maps of a polyhedral scene, Computational Geometry, Theory and Applications, 38 (2007), pp. 129-138.
• Balint Miklos, Joachim Giesen, Mark Pauly Discrete Scale Axis Representations for 3D Geometry , ACM Transactions on Graphics (Proceedings of SIGGRAPH) 2010.
• Jonathan Shewchuk, Updating and Constructing Constrained Delaunay and Constrained Regular Triangulations by Flips, Proceedings of the Nineteenth Annual Symposium on Computational Geometry (San Diego, California), pages 181-190, 2003.

• [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.
• [Robert Porter] Marco Lanzagorta and Jeffrey K. Uhlmann, Quantum computational geometry, Proc. of SPIE Vol 5436, 332, 2004.
• Nancy M. Amato, Michael T. Goodrich, Edgar Ramos, Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization, Discrete and Computational Geometry, 26:245-265, 2001.
• Therese C. Biedl, Stephane Durocher, Jack Snoeyink, Reconstructing Polygons from Scanner Data, ISAAC 2009: 862-871.
• David L. Millman, Jack Snoeyink, Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design , Symposium on Computational Geometry 2010: 386-392.
• Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa , Computing minimum-area rectilinear convex hull and L-shape, Computational Geometry, Volume 42, Issue 9, November 2009, Pages 903-912.
• Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg, On Inducing Polygons and Related Problems, in Proc. of 17th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Springer, 2009.
• [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.
• Peter Brass, Eowyn Cenek, Cristian A. Duncan, Alon Efrat, Cesim Erten, Dan P. Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S.B. Mitchell, On simultaneous planar graph embeddings, CGTA, Volume 36, Issue 2, Pages 117-130, 2007.
• [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.
• [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.
• [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.
• R. N. Karasev, A Measure of Non-convexity in the Plane and the Minkowski Sum , Discrete and Computational Geometry (DCG), Volume 44, Number 3, 608-621, 2010.
• [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).
• [Faizur Rahman] Boris Aronov, Marc van Kreveld, Maarten Löffler and Rodrigo I. Silveira, Peeling Meshed Potatoes, Algorithmica, Online First 2009.
• [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.

• George B. Purdy and Justin W. Smith, Lines, Circles, Planes and Spheres, Discrete and Computational Geometry (DCG), Online First DOI: 10.1007/s00454-010-9270-3, 2010.
• [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.
• Ileana Streinu and Louis Theran. Combinatorial Genericity and Minimal Rigidity, in SCG '08: Proceedings of the twenty-fourth annual symposium on Computational Geometry, 365–374, College Park, MD, USA, 2008.