KAUST Logo
Geometric Algorithms Group
  • Home
  • People
    • Current
    • Alumni
  • Research
    • Current Research
  • Publications
  • Teaching

Teaching

Home > Teaching

Teaching

Content Details


 

 

Computational geometry slides

 
  1. Fixed-radius near neighbors searching
  2. Convex hulls
  3. Line segment intersection
  4. Lower bounds for computational geometry problems
  5. Planar graphs, polygons and triangulations
  6. Orthogonal range searching
  7. Segment trees
  8. Introduction to randomized incremental algorithms
  9. Point location
  10. Linear programming in fixed dimension
  11. Voronoi diagrams and Delaunay triangulations
  12. Computing a Delaunay triangulation
  13. Arrangements and duality
  14. Geometric approximation algorithms

 

Enrolled students can access course material through KAUST's Blackboard via http://portal.kaust.edu.sa

No
© 2019 King Abdullah University of Science and Technology. All rights reserved.|Team Site
http://
http://
http://
The beginning and end dates for each internship will be agreed upon between the Faculty and the Intern. Visa processing time will be a determining factor in actual start date. Minimum period is three months. Maximum period is six months.
Geometric Algorithms Group
5
5