ΕΜ364/ΗΥ584 - Γεωμετρικοί Αλγόριθμοι

Στα πλαίσια του μαθήματος γίνονται παρουσιάσεις από τους φοιτητές που παρακολουθούν το μάθημα. Κάθε φοιτητής αναλαμβάνει να παρουσιάσει 3-4 papers που αντιστοιχούν σε μία θεματική περιοχή.

Οι παρουσιάσεις έχουν ως εξής:

Αντώνης Αντωνιάδης Θεματική περιοχή: Art galleries Papers: D. Eppstein, M. T. Goodrich and N. Sitchinava. Guard Placement for Efficient Point-in-Polygon Proofs. Proceedings 23rd Annual ACM Symposium on Computational Geometry, 27-36, 2007. J. Kahn, M. M. Klawe and D. Kleitman. Traditional galleries require fewer watchmen. SIAM Journal of Algebraic Discrete Methods, 4, 194-206, 1983. P. Bose, T. Shermer, G. Toussaint and B. Zhu. Guarding Polyhedral Terrains. Computational Geometry: Theory and Applications, 7(2), 173-185, 1997.

Γιώργος Γρέκας Θεματική περιοχή: Shortest paths in 3D Papers: J. S. B. Mitchell and M. Sharir. New Results on Shortest Paths in Three Dimensions. Proceedings 20th Annual ACM Symposium on Computational Geometry, 124-133, 2004. S. Har-Peled, M. Sharir and K. R. Varadarajan. Approximating shortest paths on a convex polytope in three dimensions. Proceedings 12th Annual ACM Symposium on Computational Geometry, 329-338, 1996. C. H. Papadimitriou. An algorithm for shortest paths in three dimensions. Information Processing Letters, 20:259-263, 1985. L. Gewali, S. Ntafos, and I. G. Tollis. Path planning in the presence of vertical obstacles. IEEE Transactions on Robotics and Automation, vol 6, no. 3, June 1990.

Ειρήνη Κουτάκη-Παντερμάκη Θεματική περιοχή: Surface design/reconstruction Papers: D. Meyers, S. Skinner, and K. Sloan. Surfaces from contours. ACM Transactions on Graphics, 11:228–258, 1992. A. B. Ekoule, F. C. Peyrin, and C. L. Odet. A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Transactions on Graphics, 10:182–199, 1991. G. Barequet, D. Shapiro, and A. Tal. Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. Visual Computer, 16:116–133, 2000.

Αντωνία Κουτσούβα Θεματική περιοχή: Motion planning Papers: J. S. B. Mitchell and M. Sharir. New Results on Shortest Paths in Three Dimensions. Proceedings 20th Annual Symposium on Computational Geometry, 124-133, 2004. S. Har-Peled. Constructing approximate shortest path maps in three dimensions. Proceedings 14th Annual Symposium on Computational Geometry, 383-391, 1998. J. P. van den Berg and M. H. Overmars Roadmap-Based Motion Planning in Dynamic Environments. IEEE Transactions on Robotics, 21(5):885-897, October 2005. H. Zhang and J. P. Ostrowski. Visual Motion Planning for Mobile Robots. IEEE Transactions on Automation, 18(2):199-208, April 2002.

Παναγιώτης Κουτσουράκης Θεματική περιοχή: Motion planning Papers: M. A. Erdmann and T. Lozano-Perez. On multiple moving objects. Algorithmica, 2:477--521, 1987. J. van de Berg and M. Overmars. Prioritized motion planning for multiple robots. Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems, 2217-2222, 2004. R. H. Wilson and J. C. Latombe. Geometric reasoning about mechanical assembly. Artificial Inteligence Journal, 71(2):371-396, 1994.

Δαμιανός Κυπριάδης Θεματική περιοχή: Art galleries Papers: I. Bjorling-Sachs and D. L. Souvaine. An Efficient Algorithm for Guard Placement in Polygons with Holes. Discrete Computational Geometry, 13:77-109, 1995. P. Zylinski. Orthogonal art galleries with holes: a coloring proof of Aggarwal's Theorem. The Electronic Journal of Combinatorics, 13, 2006. A. Laurentini. Guarding the walls of an art gallery. The Visual Computer. 15:265-278, 1999.

Σοφία Τριανταφύλλου Θεματική περιοχή: Art galleries Papers: S. Eidenbenz. Approximation algorithms for Terrain Guarding. Information Processing Letters (IPL), 82:99-105, 2002. S. Eidenbenz, C. Stamm and P. Widmayer. Inapproximability Results for Guarding Polygons and Terrains. Algorithmica, 31:79-113, 2001. D. T. Lee and A. K. Lin. Computational Complexity of Art Gallery Problems. IEEE Transactions on Information Theory, 32(2):276-282, 1986.

Νίκος Τσίτας Θεματική περιοχή: Motion Planning of a convex polygon in 2D Polygonal Space Papers: K. Kedem and M. Sharir. An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-dimensional Polygonal Space. Discrete Computational Geometry, 5:43-75, 1990. D. Leven and M. Sharir. Planning a Purely Transitional Motion for a Convex Object in Two-dimensional Space Using Generalized Voronoi Diagrams. Discrete Computational Geometry, 2:9-31, 1987. K. Kedem and M. Sharir. An Efficient Algorithm for Planning Collision-Free Transitional Motion of a Convex Polygonal Object in 2-dimensional Space Amidst Polygonal Obstacles. Proceedings 1st Annual ACM Symposium on Computational Geometry, 75-80, 1985.