Computational Geometry Lab Anyone can take a look at the CCCG website or the Journal of Computational Geometry, both of which are hosted here. You can also check out our uptime. http://cg.scs.carleton.ca/
Extractions: Phone: +1 613-520-2600x8756, Facs: +1 613-520-4334 Services Members of the lab can access their email via SquirrelMail and those who know username and password can access the library . Anyone can take a look at the CCCG website or the Journal of Computational Geometry , both of which are hosted here. You can also check out our uptime Seminars Our group holds a weekly research seminar People The lab supports the research of five faculty members: Prosenjit Bose Luc Devroye Anil Maheshwari Pat Morin , and Michiel Smid Our lab frequently has short-term and long-term visitors and postdocs. Currently we have several postdocs: Greg Aloupis Jean-Lou De Carufel Dania El-Khechen , and Current graduate students are: Patrice Arruda (Masters) Jacquelin Caron (PhD) Kenneth Chan (Masters) Craig Dillabaugh (PhD) ... Daming Xu (PhD) The lab supports a steady flow of visitors. Recent visitors include Mustaq Ahmed Tetsuo Asano Jeremy Barbay Mark deBerg ... David Wood , and Christian Wulff-Nilsen Hamid Zarrabi-Zadeh , and Norbert Zeh Some of our former graduate students and postdocs include Greg Aloupis (Postdoc, 2004-2006)
Handbook Of Discrete And Computational Geometry Comprehensive handbook, edited by Jacob E. Goodman and Joseph O Rourke, with 52 chapters in its first edition and 65 chapters in its second edition. http://cs.smith.edu/~orourke/books/discrete.html
Extractions: Table of Contents The second edition of the Handbook of Discrete and Computational Geometry is a thoroughly revised version of the bestselling first edition. With the addition of 500 pages and 14 new chapters covering topics such as geometric graphs, collision detection, clustering, applications of computational geometry, and statistical applications, this is a significant update. This edition includes expanded coverage on the topics of mesh generation in two and three dimensions, aspect graphs, center points, and probabilistic roadmap algorithms. It also features new results on solutions of the Kepler conjecture, and honeycomb conjecture, new bounds on k -sets, and new results on face numbers of polytopes.
Computational Geometry This course provides an introduction to the key concepts, problems, techniques and data structures within computational geometry, including Concepts http://www.cs.au.dk/~gerth/cg08/
Extractions: The participants will after the course have detailed knowledge of the fundamental problems within computation geometry and general techniques for solving problems within computational geometry and practical experience with implementation issues involved in converting computation geometry algorithms into running programs. The participants must at the end of the course be able to: This course provides an introduction to the key concepts, problems, techniques and data structures within computational geometry, including: Concepts (points, lines, planes, spheres, duality, subdivisions, degeneracies), problems (line intersections, convex hull, Voronoi diagram, triangulations, Delaunay triangulation, overlay of subdivisions, range searching), techniques (sweep-line, randomized incremental construction, fractional cascading), and data structures (double-linked edge-lists, interval trees, segment trees, and priority search trees, Kd-trees, range trees).
