COMPSCI 61A Lecture Notes - Lecture 11: Voronoi Diagram, Floating Points

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Homework party wednesday 9/21 6:30pm-8:30pm in 247 cory hall. Watch this extra video on range and int. Bonus point for submission by wednesday 9/28 @ 11:59pm. Project party wednesday 9/28 6:30-8:30pm in 247 cory hall. Homework 5 posted, due thursday 9/29 @ 11:59pm. Floating points (only keep track of nite precision) Converting oating points to integers round(1. 9) => 2 int(1. 9) => 1 float(1) => 1. 0. Create a visualization customized to a single person, showing them where they would like to stand on or near the berkeley campus. Makes use of k-means algorithm and linear regression to predict where someone should stay so that they are in a region nearby to the restaurants the person prefers. Implement the predictions for restaurants which the user has not reviewed. A method for combining data values satis es the closure property if: the result of combination can itself be combined using the same method.