News:

• 2010-06-01: TUTORIAL (DIFFERENT TIME AND LOCATION): On Thursday, 03 June 2010 at 14:00-16:00, there will be a tutorial in Seminar room 028, New Law School (that is where the lecture normally took place).
• 2010-05-26: TUTORIAL: On Friday (28 May 2010) at 13:00, there will be a tutorial. DIFFERENT PLACE: School of IT meeting room 402, Level 4 (the meeting room is very close to the lift).
• 2010-05-18: TUTORIAL: On Friday (21 May 2010) at 13:00, there will be a tutorial. Same place as before.
• 2010-05-11: TUTORIAL: On Friday (14 May 2010) at 13:00, there will be a tutorial. Same place as before.
• 2010-05-06: "Assignment 3" available, deadline: 2010-05-28
• 2010-05-05: About Assignment 2, Q2: The rectangles are orthogonal rectangles.
• 2010-05-05: "Planar Point Location" handout available
• 2010-05-04: About Assignment 2, Q5: Someone asked about the definition of NN when we have, for instance, three equidistant points. Will NN have edges between all of them? Or is such a point set not allowed? The answer to such questions is: "it is up to you". You can decide/assume one of the options and go with it. Your decision/assumption won't have an impact on the fact that the maximum degree is at most 6.
• 2010-05-04: TUTORIAL: On Friday (7 May 2010) at 13:00, there will be a tutorial. Same place as before.
• 2010-04-29: TUTORIAL: On Friday (30 April 2010) at 13:00, there will be a tutorial. Same place as before.
• 2010-04-27: "Delaunay Triangulations and Other Proximity Graphs" handout available
• 2010-04-23: MORE TUTORIALS: On Tuesday (27 April 2010) at 14:00, there will be a tutorial. It takes place in the NICTA meeting room in the School of IT, on level 5, West wing. Use the intercom to get in (perhaps ring the meeting room).
• 2010-04-22: TUTORIALS: On Friday (23 April 2010) at 13:00, there will be a tutorial. It takes place in the NICTA meeting room in the School of IT, on level 5, West wing. Use the intercom to get in (perhaps ring the meeting room).
• 2010-04-20: "Voronoi Diagram" handout available
• 2010-04-18: About the questions for the exam and the assignments:
  For the exam, you will have just a few hours, while for the assignments you have three weeks. Therefore, the questions for the exam will be easy enough to answer within the exam time. If you did and understood the homework assignments, then you do not need to worry about the exam.
• 2010-04-15: "Assignment 2" available, deadline: 2010-05-06
• 2010-04-13: "Orthogonal Range Searching 2" handout available
• 2010-04-08: UPDATE: "Orthogonal Range Searching 1" handout
  In the lecture and in the handout (slide 14) as well as in the book (page 101, second edition) the median was defined inconsistently (with respect to the figures).
  The correct definition should read: ''The median of a set of n numbers is the ceiling(n/2)-th smallest element.''
  The updated handout and the third edition of the book do not contain this error.
• 2010-03-30: "Orthogonal Range Searching 1" handout available
• 2010-03-25: "Assignment 1" available, deadline: 2010-04-15
• 2010-03-23: "Linear Programming" handout available
• 2010-03-15: "Polygon triangulation part 2" handout available
• 2010-03-08: "Segment Intersection" handout available
• 2010-03-08: "Convex Hulls and Sweep Line Technique" handout available
• 2010-03-04: Unit of Study Outline and Assessment Details available
• 2010-03-02: "Polygon Triangulation and Art Gallery Problem" handout available
• Lectures every Thursday 14:00-16:00
  starting on the 4th of March 2010.
• COMP5045 webpages are up and running. All the necessary material, including the assignments and in some cases lecture notes, will be made available here. So check it regularly!